A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times

In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous work and propose a new neighborhood structure for this problem which is based on reversing operations on a critical path. We have conducted an experimental study across the conventional benchmarks and some new ones of larger size. The results of these experiments show clearly that our approach outperforms the current state-of-the-art methods.

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

[2]  Camino R. Vela,et al.  Genetic Algorithms Hybridized with Greedy Algorithms and Local Search over the Spaces of Active and Semi-active Schedules , 2005, CAEPIA.

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

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

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

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

[7]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[8]  J. Wesley Barnes,et al.  Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches , 2005, Eur. J. Oper. Res..

[9]  Jorge Puente,et al.  Combining metaheuristics for the job shop scheduling problem with sequence dependent setup times , 2006, ICSOFT.

[10]  Christian Artigues,et al.  A branch and bound method for the job-shop problem with sequence-dependent setup times , 2008, Ann. Oper. Res..

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

[12]  Dirk C. Mattfeld,et al.  Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling , 1996, Production and Logistics.

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

[14]  Peter Brucker,et al.  Complex Scheduling (GOR-Publications) , 2006 .

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

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

[17]  Peter Brucker,et al.  Complex Scheduling , 2006 .

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

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

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

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

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

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

[24]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

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

[26]  Sheik Meeran,et al.  New and “Stronger” Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki (1996) , 2000, J. Heuristics.

[27]  Hong Zhou,et al.  Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times , 2001, Ann. Oper. Res..

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