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

Journal of Heuristics

Volumn 16, Issue 2, 2010, Pages 139-165

  Vela, Camino R ^a   Varela, Ramiro ^a   González, Miguel A ^a  

^a UNIVERSITY OF OVIEDO   (Spain)

Author keywords

Genetic algorithms; Job shop scheduling; Local search; Setup times

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; EXPERIMENTAL STUDIES; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; LOCAL SEARCH; LOCAL SEARCH METHOD; NEIGHBORHOOD STRUCTURE; SEQUENCE-DEPENDENT SETUP TIME; SET-UP TIME; SETUP TIMES; STATE-OF-THE-ART METHODS;

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS;

TABU SEARCH;

EID: 77952239692     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-008-9094-y     Document Type: Article

References (51)

1. J. Adams E. Balas Z. D. 1988 The shifting bottleneck procedure for jobshop scheduling Manag. Sci. 34 391 401 0637.90051 10.1287/mnsc.34.3.391
2. A. Allahverdi J. Gupta T. Aldowaisan 1999 A review of scheduling research involving setup considerations Omega 27 219 239 10.1016/S0305-0483(98)00042-5
3. D. Applegate W. Cook 1991 A computational study of the job-shop scheduling problem ORSA J. Comput. 3 149 156 0755.90039
4. V.A. Armentano O.C. Basi de Araujo 2006 Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times J. Heuristics 12 869 427 446 10.1007/s10732-006-6662-x (Pubitemid 44619124)
5. C. Artigues D. Feillet 2008 A branch and bound method for the job-shop problem with sequence-dependent setup times Ann. Oper. Res. 159 1 135 159 1152.90424 10.1007/s10479-007-0283-0 2388357
6. Artigues, C., Lopez, P.: Extending Giffler-Thompson algorithm to generate active schedules for job-shops with sequence-dependent setup times. LIA Report 129, University of Avignon (2000)
7. Artigues, C., Belmokhtar, S., Feillet, D.: A new exact solution algorithm for the job shop problem with sequence-dependent setup times. In: Régin, J.C., Rueher, M. (eds.) 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. LNCS, vol. 3011, pp. 37-49. Springer, Berlin (2004)
8. Artigues, C., Buscaylet, F., Feillet, D.: Lower and upper bound for the job shop scheduling problem with sequence-dependent setup times. In: Proceedings of the Second Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA'2005) (2005a)
9. C. Artigues P. Lopez P. Ayache 2005 Schedule generation schemes for the job shop problem with sequence-dependent setup times: Dominance properties and computational analysis Ann. Oper. Res. 138 21 52 1091.90014 10.1007/s10479-005- 2443-4 2169979 (Pubitemid 41241789)
10. E. Aydin T.C. Fogarty 2004 A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems J. Heuristics 10 3 269 292 10.1023/B:HEUR.0000026896.44360.f9
11. Balas, E., Simonetti, N., Vazacopoulos, A.: Job shop scheduling with set-up times, deadlines and precedence constraints. In: Proceedings of MISTA'2005 (2005)
12. C. Bierwirth 1995 A generalized permutation approach to jobshop scheduling with genetic algorithms Oper. Res. Spectrum 17 87 92 0843.90056 10.1007/BF01719250
13. Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Berlin (2004)
14. P. Brucker O. Thiele 1996 A branch and bound method for the general-job shop problem with sequence-dependent setup times Oper. Res. Spektrum 18 145 161 0852.90087 10.1007/BF01539706 1397929
15. P. Brucker B. Jurisch B. Sievers 1994 A branch and bound algorithm for the job-shop scheduling problem Discrete Appl. Math. 49 107 127 0802.90057 10.1016/0166-218X(94)90204-6 1272483
16. Buscaylet, F., Artigues, C.: A fast tabu search method for the job-shop problem with sequence-dependent setup times. In: Fifth Metaheuristics International Conference MIC2003 (Kyoto) (2003)
17. M. Candido S. Khator R. Barcias 1998 A genetic algorithm based procedure for more realistic job shop scheduling problems Int. J. Prod. Res. 36 12 3437 3457 0946.90527 10.1080/002075498192148
18. J. Carlier E. Pinson 1989 An algorithm for solving the job shop problem Manag. Sci. 35 166 176 10.1287/mnsc.35.2.164 985230
19. J. Carlier E. Pinson 1994 Adjustment of heads and tails for the job-shop problem Eur. J. Oper. Res. 78 146 161 0812.90063 10.1016/0377-2217(94)90379-4
20. W. Cheung H. Zhou 2001 Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times Ann. Oper. Res. 107 65 81 1019.90050 10.1023/A:1014990729837 1900424 (Pubitemid 33634450)
21. I. Choi D. Choi 2002 A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups Eur. J. Oper. Res. 90 252 268
22. I. Choi O. Korkmaz 1997 Job shop scheduling with separable sequence-dependent setup times Ann. Oper. Res. 70 155 170 0890.90094 10.1023/A:1018918003761 1456798
23. M. Dell' Amico M. Trubian 1993 Applying tabu search to the job-shop scheduling problem Ann. Oper. Res. 41 231 252 0771.90056 10.1007/BF02023076
24. E. Demirkol S. Mehta R. Uzsoy 1997 A computational study of shifting bottleneck procedures for shop scheduling problems J. Heuristics 3 2 111 137 1071.90531 10.1023/A:1009627429878
25. Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: Proceedings of Fifth International Conference on Artificial Intelligence Planning and Scheduling, pp. 91-101 (2000)
26. B. Giffler G. Thomson 1960 Algorithms for solving production scheduling problems Oper. Res. 8 487 503 0248.90022 10.1287/opre.8.4.487
27. Goldberg, D.: Genetic Algorithms in Search. Optimization and Machine Learning. Addison-Wesley, Reading (1985)
28. González, M., Sierra, M., Vela, C., Varela, R.: Genetic algorithms hybridized with greedy algorithms and local search over the spaces of active and semi-active schedules. In: Current Topics in Artificial Intelligence. 11th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2005. LNCS, vol. 4177, pp. 231-240. Springer, Berlin (2006a). Revised Selected Papers
29. González, M., Sierra, M., Vela, C., Varela, R., Puente, J.: Combining metaheuristics for the job shop scheduling problem with sequence dependent setup times. In: Proceedings of the First International Conference on Software and Data Technologies, ICSOFT'2006, pp. 211-220 (2006b)
30. Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. The University of Michigan Press, Ann Arbor (1975)
31. P. Ives M. Lambrecht 1996 Extending the shifting bottleneck procedure to real-life applications Eur. J. Oper. Res. 90 3 252 268
32. A.S. Jain B. Rangaswarny S. Meeran 2000 New and "stronger" job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996) J. Heuristics 6 4 457 480 0972.68629 10.1023/A:1009617209268
33. S. Kim P. Bobrowski 1994 Impact of sequence-dependent setup time on job shop scheduling performance Int. J. Prod. Res. 32 7 1503 1520 0901.90130 10.1080/00207549408957019
34. Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Technical Report, Graduate School of Industrial Administration, Carnegie Mellon University (1984)
35. Matsuo, H., Suh, C., Sullivan, R.: A controlled search simulated annealing method for the general jobshop scheduling problem. Working Paper 03-44-88, Graduate School of Business, University of Texas (1988)
36. Mattfeld, D.: Evolutionary Search and the Job Shop. Investigations on Genetic Algorithms for Production Scheduling. Springer, Berlin (1995)
37. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Program, 2nd, Extended edn Springer, Berlin (1994)
38. D. Miller H.-C. Chen J. Matson Q. Liu 1999 A hybrid genetic algorithm for the single machine scheduling problem J. Heuristics 5 4 437 454 1071.90537 10.1023/A:1009684406579 (Pubitemid 30546647)
39. L. Mönch R. Schabacker D. Pabst J. Fowler 2007 Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops Eur. J. Oper. Res. 177 3 2100 2118 1109.90044 10.1016/j.ejor.2005.12.020 (Pubitemid 44709466)
40. Noivo, A., Ramalhinho-Lourenço, H.: Solving two production scheduling problems with sequence-dependent set-up times. Technical Report 138, Department of Economic and Business, Universitat Pompeu Fabra, Barcelona (1998)
41. E. Nowicki C. Smutnicki 1996 A fast taboo search algorithm for the job shop problem Manag. Sci. 42 797 813 0880.90079 10.1287/mnsc.42.6.797 (Pubitemid 126577322)
42. R.Z. Rios-Mercado J.F. Bard 1999 An enhanced tsp-based heuristic for makespan minimization in a floor shop with setup times J. Heuristics 5 1 53 70 0948.90071 10.1023/A:1009691028143
43. Roy, B., Sussmann, B.: Les problèmes d'ordonnancement avec constraintes disjonctives. Note DS n.6 bis, SEMA, Matrouge, 6 (1964)
44. E. Taillard 1993 Parallel taboo search techniques for the job shop scheduling problem ORSA J. Comput. 6 108 117
45. P. Van Laarhoven E. Aarts K. Lenstra 1992 Job shop scheduling by simulated annealing ORSA J. Comput. 40 113 125 0751.90039
46. R. Varela C. Vela J. Puente A. Gomez 2003 A knowledge-based evolutionary strategy for scheduling problems with bottlenecks Eur. J. Oper. Res. 145 57 71 1012.90007 10.1016/S0377-2217(02)00205-9 1947156
47. Varela, R., Serrano, D., Sierra, M.: New codification schemas for scheduling with genetic algorithms. In: Proceedings of the First International Work-conference on the Interplay between Natural and Artificial Computation, IWINAC 2005. LNCS, vol. 3562, pp. 11-20. Springer, Berlin (2005)
48. J. Wilbrech W. Prescott 1969 The influence of setup time on job shop performance Manag. Sci. 16 4 391 401
49. Yamada, T., Nakano, R.: Scheduling by genetic local search with multi-step crossover. In: Fourth Int. Conf. on Parallel Problem Solving from Nature (PPSN IV), pp. 960-969 (1996)
50. Y. Zhou B. Li J. Yang 2006 Study on job shop scheduling with sequence-dependent setup times using biological immune algorithm Int. J. Adv. Manuf. Technol. 30 1-2 105 111 10.1007/s00170-005-0022-0 2370453 (Pubitemid 44180580)
51. J. Zoghby J. Barnes H. J.J. 2005 Modeling the re-entrant job shop scheduling problem with setup for metaheuristic searches Eur. J. Oper. Res. 167 336 348 1075.90034 10.1016/j.ejor.2004.03.027 (Pubitemid 40219983)