An efficient memetic algorithm for solving the job shop scheduling problem

The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an efficient MA with a novel local search is proposed to solve the JSP. Within the local search, a systematic change of the neighborhood is carried out to avoid trapping into local optimal. And two neighborhood structures are designed by exchanging and inserting based on the critical path. The objective of minimizing makespan is considered while satisfying a number of hard constraints. The computational results obtained in experiments demonstrate that the efficiency of the proposed MA is significantly superior to the other reported approaches in the literature.

[1]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[2]  Philippe Lacomme,et al.  A memetic algorithm for the job-shop with time-lags , 2008, Comput. Oper. Res..

[3]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[4]  Hyung Rim Choi,et al.  A hybrid genetic algorithm for the job shop scheduling problems , 2003, Comput. Ind. Eng..

[5]  Voratas Kachitvichyanukul,et al.  Multiple colony ant algorithm for job-shop scheduling problem , 2008 .

[6]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[7]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

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

[9]  Pablo Moscato,et al.  A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem , 2004, J. Heuristics.

[10]  Yin Ai-hua,et al.  An improved shifting bottleneck procedure for the job shop scheduling problem , 2004 .

[11]  Shengxiang Yang,et al.  A new adaptive neural network and heuristics hybrid approach for job-shop scheduling , 2001, Comput. Oper. Res..

[12]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[13]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[14]  Tung-Kuan Liu,et al.  An improved genetic algorithm for job-shop scheduling problems using Taguchi-based crossover , 2008 .

[15]  Can Akkan,et al.  The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm , 2004, Eur. J. Oper. Res..

[16]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[17]  Pablo Moscato,et al.  A memetic algorithm for the total tardiness single machine scheduling problem , 2001, Eur. J. Oper. Res..

[18]  Bernd Freisleben,et al.  Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..

[19]  Emin Gundogar,et al.  Fuzzy priority rule for job shop scheduling , 2004, J. Intell. Manuf..

[20]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[21]  Yanchun Liang,et al.  Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems , 2008 .

[22]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[23]  Peter B. Luh,et al.  An alternative framework to Lagrangian relaxation approach for job shop scheduling , 2003, Eur. J. Oper. Res..

[24]  J. Billaut,et al.  A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint , 2002, J. Oper. Res. Soc..

[25]  Guan-Chun Luh,et al.  A multi-modal immune algorithm for the job-shop scheduling problem , 2009, Inf. Sci..

[26]  César Rego,et al.  A filter-and-fan approach to the job shop scheduling problem , 2009, Eur. J. Oper. Res..

[27]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[28]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[29]  Tarek Y. ElMekkawy,et al.  A new memetic algorithm for optimizing the partitioning problem of tandem AGV systems , 2009 .

[30]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

[31]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[32]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[33]  Michael Kolonko,et al.  Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..