MEMETIC ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING WITH PREEMPTION

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) or flexible job shop scheduling with overlapping in operation is proposed that solves the FJSP to minimize makespan time and obtain the optimum solution for small problem and best solution for medium and large scale problems .In this paper we also used preemption to improve the results of memetic algorithm and reduce the makespan.

[1]  Mohammad Saidi-Mehrabad,et al.  Flexible job shop scheduling with tabu search algorithms , 2007 .

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

[3]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[4]  Francis Sourd,et al.  A new model for the preemptive earliness-tardiness scheduling problem , 2009, Comput. Oper. Res..

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

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

[7]  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).

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

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

[10]  Xin Wang,et al.  A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions , 2009, Discret. Optim..

[11]  Francis Sourd,et al.  The one-machine just-in-time scheduling problem with preemption , 2009, Discret. Optim..

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

[13]  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..

[14]  W. Yeh.  A Memetic Algorithm for the n/2/Flowshop/αF + βCmax Scheduling Problem , 2002 .

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

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

[17]  Rjm Rob Vaessens.  Generalized job shop scheduling : complexity and local search , 1995 .

[18]  I. Mahdavi,et al.  SOLVING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM BY A GENETIC ALGORITHM , 2008 .

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

[20]  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.