Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times

The Job Shop Scheduling Problem (JSP) is an example of a combinatorial optimization problem that has interested researchers for several decades. In this paper we confront an extension of this problem called JSP with Sequence Dependent Setup Times (SDST-JSP). The approach extends a genetic algorithm and a local search method that demonstrated to be efficient in solving the JSP. For local search, we have formalized neighborhood structures that generalize three well-know structures defined for the JSP. We have conducted an experimental study across conventional benchmark instances showing that the genetic algorithm exploited in combination with the local search, considering all three neighborhoods at the same time, provides the best results. Moreover, this approach outperforms the current state-of-the-art methods.

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

[2]  Zbigniew Michalewicz,et al.  Genetic Algorithms Plus Data Structures Equals Evolution Programs , 1994 .

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

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

[5]  Vinícius Amaral Armentano,et al.  Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times , 2006, J. Heuristics.

[6]  D. E. Goldberg,et al.  Optimization and Machine Learning , 2022 .

[7]  Jianguo Yang,et al.  Study on job shop scheduling with sequence-dependent setup times using biological immune algorithm , 2006 .

[8]  Qiang Liu,et al.  A Hybrid Genetic Algorithm for the Single Machine Scheduling Problem , 1999, J. Heuristics.

[9]  Marc Lambrecht,et al.  Extending the shifting bottleneck procedure to real-life applications , 1996 .

[10]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

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

[13]  Alberto Gómez,et al.  A knowledge-based evolutionary strategy for scheduling problems with bottlenecks , 2003, Eur. J. Oper. Res..

[14]  Jonathan F. Bard,et al.  An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times , 1999, J. Heuristics.

[15]  Takeshi Yamada,et al.  Scheduling by Genetic Local Search with Multi-Step Crossover , 1996, PPSN.

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

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

[18]  I. Choi,et al.  A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups , 2002 .

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

[20]  Christian Artigues,et al.  A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times , 2004, CPAIOR.

[21]  John W. Fowler,et al.  Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops , 2007, Eur. J. Oper. Res..

[22]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[23]  In-Chan Choi,et al.  Job shop scheduling with separable sequence-dependent setups , 1997, Ann. Oper. Res..

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

[25]  Reha Uzsoy,et al.  A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems , 1997, J. Heuristics.

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

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

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

[29]  S. C. Kim,et al.  Impact of sequence-dependent setup time on job shop scheduling performance , 1994 .

[30]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

[31]  Jon K. Wilbrecht,et al.  The Influence of Setup Time on Job Shop Performance , 1969 .

[32]  Helena Ramalhinho Dias Lourenço,et al.  Solving Two Production Scheduling Problems with Sequence-Dependent Set-Up Times , 1999 .

[33]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

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

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

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

[37]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[38]  M. A. B. Candido,et al.  A genetic algorithm based procedure for more realistic job shop scheduling problems , 1998 .

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

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

[41]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

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

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

[44]  Wim Nuijten,et al.  Solving Scheduling Problems with Setup Times and Alternative Resources , 2000, AIPS.

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

[46]  Alberto Bugarín,et al.  Current Topics in Artificial Intelligence, 11th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2005, Santiago de Compostela, Spain, November 16-18, 2005, Revised Selected Papers , 2006, CAEPIA.

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

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

[49]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[50]  Mehmet Emin Aydin,et al.  A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems , 2004, J. Heuristics.