A competent memetic algorithm for complex scheduling

We face the job shop scheduling problem with sequence dependent setup times and makespan minimization by memetic algorithm. This algorithm combines a classic genetic algorithm with a local searcher. The performance of the local searcher relies on the combination of a tabu search algorithm with a neighborhood structure termed NS that are thoroughly described and analyzed. Also, two evolution models are considered: Lamarckian and Baldwinian evolution. We report results from an experimental study across conventional benchmark instances showing that the proposed algorithm outperforms the current state-of-the-art methods and that Lamarckian evolution is better than Baldwinian evolution.

[1]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[2]  Camino R. Vela,et al.  Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times , 2010, J. Heuristics.

[3]  Jorge Puente,et al.  Sensitivity Analysis for the Job Shop Problem with Uncertain Durations and Flexible Due Dates , 2007, IWINAC.

[4]  Anders Bjerg Pedersen,et al.  A Fast Taboo Search Algorithm for the Job Shop Scheduling Problem , 2008 .

[5]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[6]  C. Bierwirth.  A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[7]  María R. Sierra,et al.  New Codification Schemas for Scheduling with Genetic Algorithms , 2005, IWINAC.

[8]  Pierre Lopez,et al.  Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis , 2005, Ann. Oper. Res..

[9]  Peigen Li,et al.  A very fast TS/SA algorithm for the job shop scheduling problem , 2008, Comput. Oper. Res..

[10]  J. Christopher Beck.  Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling , 2007, J. Artif. Intell. Res..

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

[12]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[13]  Egon Balas,et al.  Job shop scheduling with setup times, deadlines and precedence constraints , 2008, J. Sched..

[14]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[15]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[16]  R. Lewontin.  ‘The Selfish Gene’ , 1977, Nature.

[17]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[18]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

[19]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

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

[21]  P. Brucker,et al.  A branch & bound method for the general-shop problem with sequence dependent setup-times , 1996 .

[22]  Camino R. Vela,et al.  A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times , 2008, ICAPS.

[23]  J. Christopher Beck,et al.  Combining Constraint Programming and Local Search for Job-Shop Scheduling , 2011, INFORMS J. Comput..

[24]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

[25]  C. R. Vela,et al.  Tabu Search and Genetic Algorithm for Scheduling with Total Flow Time Minimization , 2010 .