Flexible job-shop scheduling problems with ‘AND’/‘OR’ precedence constraints

The purpose of this research is to solve flexible job-shop scheduling problems with ‘AND’/‘OR’ precedence constraints in the operations. We first formulate the problem as a Mixed-Integer Linear Program (MILP). The MILP can be used to compute optimal solutions for small-sized problems. We also developed a heuristic algorithm that can obtain a good solution for the problem regardless of its size. Moreover, we have developed a representation and schedule builder that always produces a legal and feasible solution for the problem, and developed genetic and tabu search algorithms based on the proposed schedule builder. The results of the computational experiments show that the developed meta-heuristics are very effective.

[1]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

[2]  I. Moon,et al.  Genetic algorithms for job shop scheduling problems with alternative routings , 2008 .

[3]  Jesuk Ko,et al.  A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling , 2003, Comput. Oper. Res..

[4]  Ming Liang,et al.  A mixed-integer programming approach to the machine loading and process planning problem in a process layout environment , 1990 .

[5]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[6]  Jim Hutchison,et al.  Scheduling approaches for random job shop flexible manufacturing systems , 1991 .

[7]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[8]  Ji-Hyung Park,et al.  A Genetic Algorithm Approach to Job Shop Scheduling Considering Alternative Process Plans , 1998 .

[9]  Andrew Y. C. Nee,et al.  A modified genetic algorithm for distributed scheduling problems , 2003, J. Intell. Manuf..

[10]  W. E. Wilhelm,et al.  Effectiveness of alternate operations in a flexible manufacturing system , 1985 .

[11]  Mitsuo Gen,et al.  A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems , 2007, Comput. Ind. Eng..

[12]  Chiung Moon,et al.  Advanced planning and scheduling with outsourcing in manufacturing supply chain , 2002 .

[13]  Hong Zhou,et al.  The hybrid heuristic genetic algorithm for job shop scheduling , 2001 .

[14]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[15]  Kyoung Seok Shin,et al.  The Integration of FMS Process Planning and Scheduling Using an Asymmetric Multileveled Symbiotic Evolutionary Algorithm , 2004 .

[16]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[17]  Zuobao Wu,et al.  Multiagent scheduling method with earliness and tardiness objectives in flexible job shops , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[18]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[19]  Richard Y. K. Fung,et al.  Integrated process planning and scheduling by an agent-based ant colony optimization , 2010, Comput. Ind. Eng..

[20]  Richard Y. K. Fung,et al.  An agent-based negotiation approach to integrate process planning and scheduling , 2006 .

[21]  Elsayed A. Elsayed,et al.  Job shop scheduling with alternative machines , 1990 .

[22]  Sun Hur,et al.  Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain , 2002 .

[23]  Yeo Keun Kim,et al.  A Multi-level Symbiotic Evolutionary Algorithm for FMS Loading Problems with Various Flexibilities , 2003 .

[24]  Liang Gao,et al.  An effective hybrid algorithm for integrated process planning and scheduling , 2010 .

[25]  Mitsuo Gen,et al.  Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem , 2009 .