Hybrid Genetic Algorithm for Flexible Job Shop Scheduling with Overlapping in Operations

Flexible job shop scheduling problem )FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. FJSP is NP-hard and mainly presents two difficulties. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on the machines. However, it is quite difficult to achieve an optimal solution to this problem in medium and large size problems with traditional optimization approaches. In this paper a memetic algorithm )MA) for flexible job shop scheduling with overlapping in operation is proposed that solves the FJSP to minimize makespan time. The experimental results show that the proposed algorithm is capable to achieve the optimal solution for small size problems and near optimal solutions for medium and large size problems

[1]  Jamal Arkat,et al.  Flexible job shop scheduling with overlapping in operations , 2009 .

[2]  Jian-Bo Yang,et al.  GA-based discrete dynamic programming approach for scheduling in FMS environments , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Peter Brucker,et al.  Tabu-search for the multi-mode job-shop problem , 1998 .

[4]  Ramón Alvarez-Valdés,et al.  A heuristic to schedule flexible job-shop in a glass factory , 2005, Eur. J. Oper. Res..

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

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

[7]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[8]  Kyung Mi Lee,et al.  A genetic algorithm for general machine scheduling problems , 1998, 1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111).

[9]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[10]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[11]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[12]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..