An Efficient Memetic Algorithm for the Flexible Job Shop with Setup Times

This paper addresses the flexible job shop scheduling problem with sequence-dependent setup times (SDST-FJSP). This is an extension of the classical job shop scheduling problem with many applications in real production environments. We propose an effective neighborhood structure for the problem, including feasibility and non improving conditions, as well as procedures for fast neighbor estimation. This neighborhood is embedded into a genetic algorithm hybridized with tabu search. We conducted an experimental study to compare the proposed algorithm with the state-of-the-art in the SDST-FJSP and also in the standard FJSP. In this study, our algorithm has obtained better results than those from other methods. Moreover, it has established new upper bounds for a number of instances.

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

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

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

[4]  Mohamed Haouari,et al.  Discrepancy search for the flexible job shop scheduling problem , 2010, Comput. Oper. Res..

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

[6]  Yazid Mati,et al.  A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem , 2008, Comput. Oper. Res..

[7]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

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

[9]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[10]  Roman Barták,et al.  Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems , 2010 .

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

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

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

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

[15]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[16]  Camino R. Vela,et al.  A competent memetic algorithm for complex scheduling , 2012, Natural Computing.

[17]  Camino R. Vela,et al.  An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization , 2012, Soft Computing.

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

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

[20]  Stephen F. Smith,et al.  Applying Iterative Flattening Search to the Job Shop Scheduling Problem with Alternative Resources and Sequence Dependent Setup Times , 2022 .

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

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