Hybrid rollout approaches for the job shop scheduling problem

Journal of Optimization Theory and Applications

Volumn 139, Issue 2, 2008, Pages 419-438

  Guerriero, F ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Hybrid approach; Job shop scheduling; Local search methods; Priority dispatch rule; Rollout algorithms

Indexed keywords

HEURISTIC METHODS; LOCAL SEARCH (OPTIMIZATION);

DETERMINISTICS; DISPATCH RULES; HEURISTICS APPROACHES; HYBRID APPROACH; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; LOCAL SEARCH METHOD; PRIORITY DISPATCH RULE; ROLLOUT ALGORITHMS; SOLUTION ALGORITHMS;

JOB SHOP SCHEDULING;

EID: 54049083036     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-008-9362-x     Document Type: Article

References (49)

1. J. Blazewicz W. Domschke E. Pesch 1996 The job shop scheduling problem: conventional and new solution techniques Eur. J. Oper. Res. 93 1 33
2. J.K. Lenstra A.H.G. Rinnooy Kan 1979 Computational complexity of discrete optimization problems Ann. Discrete Math. 4 121 140
3. Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 225-251. Prentice Hall, Englewood Cliffs (1963)
4. J. Carlier E. Pinson 1989 An algorithm for solving the job-shop problem Manage. Sci. 35 164 176
5. A.S. Jain S. Meeran 1999 A state-of-the-art review of job-shop scheduling techniques Eur. J. Oper. Res. 113 390 434
6. B. Giffer G.L. Thompson 1960 Algorithms for solving production scheduling problems Oper. Res. 8 487 503
7. P. Brucker B. Jurisch B. Sievers 1994 A branch and bound algorithm for the job-shop scheduling problem Discrete Appl. Math. 49 105 127
8. J. Carlier E. Pinson 1990 A practical use of Jackson's preemptive schedule for solving the job-shop problem Ann. Oper. Res. 26 269 287
9. D.P. Williamson L.A. Hall J.A. Hoogeveen C.A.J. Hurkens J.K. Lenstra S.V. Sevastjanov D.B. Shmoys 1997 Short shop schedules Oper. Res. 45 2 288 294
10. D. Applegate W. Cook 1991 A computational study of the job-shop scheduling problem ORSA J. Comput. 3 149 156
11. Pinson, E.: The job shop scheduling problem: a concise survey and some recent developments. In: Chrétienne, P., Coffman Jr., E.G., Lenstra, J.K., Liu, Z. (eds.) Scheduling theory and its application, pp. 277-293. Wiley, New York (1995)
12. R.J.M. Vaessens E.H.L. Aarts J.K. Lenstra 1996 Job shop scheduling by local search INFORMS J. Comput. 8 302 317
13. R. Cheng M. Gen Y. Tsujimura 1999 A tutorial survey of job-shop scheduling using genetic algorithms, part II: hybrid genetic search strategies Comput. Ind. Eng. 36 343 364
14. French, S.: Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Ellis Horwood, Chichester (1982)
15. C. Gray M. Hoesada 1991 Matching heuristic scheduling rules for job shops to the business sales level Prod. Invent. Manage. J. 4 12 17
16. Goncalves, J.F., Mendes, J.M.: A look-ahead dispatching rule for scheduling operations. VII Latin-Ibero-American Conference on Operations Research and Systems Engineering, University of Chile, Santiago (1994)
17. J. Adams E. Balas D. Zawack 1988 The shifting bottleneck procedure for job shop scheduling Manage. Sci. 34 391 401
18. H.R. Lourenco 1995 Local optimization and the job-shop scheduling problem Eur. J. Oper. Res. 83 347 364
19. Lourenco, H.R., Zwijnenburg, M.: Combining the large-step optimization with tabu-search: application to the job-shop scheduling problem. In: Osman, I.H., Kelly, J.P. (eds.) Metaheuristics: Theory and Applications, pp. 219-236. Kluwer, Boston (1996)
20. P.J.M.V. Laarhoven E.H.L. Aarts J.K. Lenstra 1992 Job shop scheduling by simulated annealing Oper. Res. 40 113 125
21. E.D. Taillard 1994 Parallel taboo search techniques for the job shop scheduling problem ORSA J. Comput. 6 2 108 117
22. E. Nowicki C. Smutnicki 1996 A fast taboo search algorithm for the job-shop problem Manage. Sci. 42 6 797 813
23. F. Pezzella E. Merelli 2000 A tabu search method guided by shifting bottleneck for the job shop scheduling problem Eur. J. Oper. Res. 120 297310
24. Davis, L.: Job shop scheduling with genetic algorithms. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 136-149. Erlbaum, Hillsdale (1985)
25. Storer, R.H., Wu, S.D., Park, I.: Genetic algorithms in problem space for sequencing problems. In: Proceedings of a Joint US-German Conference on Operations Research in Production Planning and Control, pp. 584-597 (1992)
26. E.H.L. Aarts P.J.M. Van Laarhoven J.K. Lenstra N.L.J. Ulder 1994 A computational study of local search algorithms for job shop scheduling ORSA J. Comput. 6 118 125
27. F. Croce R. Tadei G. Volta 1995 A genetic algorithm for the job shop problem Comput. Oper. Res. 22 1 15 24
28. U. Dorndorf E. Pesch 1995 Evolution based learning in a job shop environment Comput. Oper. Res. 22 25 40
29. J.F. Goncalves N.C. Beirão 1999 Um algoritmo gentico baseado em chaves aleatrias para sequenciamento de operaes Revista Associao Portuguesa de Desenvolvimento e Investigao Operacional 19 123 137 (in Portuguese)
30. Oliveira, J.A.V.: Aplicao de modelos e algoritmos de investigao operacional ao planeamento de operaes em armazns. Ph.D. Thesis, Universidade do Minho, Portugal (2000). In Portuguese
31. Goncalves, J.F., de Magalhães Mendes, J.J., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. AT&T Labs Research Technical Report TD-5EAL6J, September 2002
32. Coello Coello, C.A., Cortés Rivas, D., Cruz Cortés, N.: Job shop scheduling using the clonal selection principle. In: Parmee, I.C. (ed.) Adaptive Computing in Design and Manufacture VI, pp. 113-124. Springer, London (2004)
33. Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: A GRASP for job shop scheduling. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 59-80. Kluwer, Boston (2001)
34. R.M. Aiex S. Binato M.G.C. Resende 2003 Parallel GRASP with path-relinking for job shop scheduling Parallel Comput. 29 4 393 430
35. L. Wang D. Zheng 2001 An effective hybrid optimisation strategy for job-shop scheduling problems Comput. Oper. Res. 28 585 596
36. Sevkli, M., Aydin, M.E.: Collaborating variable neighborhood search algorithms for job shop scheduling problems. In: Proceedings of 5th International Symposium on Intelligent Manufacturing Systems, pp. 450-461, Department of Industrial Engineering, Sakarya University (2006)
37. C. Blum M. Sampels 2004 An ant colony optimization algorithm for shop scheduling problems J. Math. Model. Algorithms 3 285 308
38. D.P. Bertsekas J.N. Tsitsiklis C. Wu 1997 Rollout algorithms for combinatorial optimization problems J. Heuristics 3 245262
39. Wu, C.: The job shop scheduling problem. Technical Report, Laboratory of Information and Decision System, MIT, Cambridge, Boston (1999)
40. C. Meloni D. Pacciarelli M. Pranzo 2004 A rollout metaheuristic for job shop scheduling problems Ann. Oper. Res. 131 215 235
41. Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974)
42. I. Sabuncuoglu M. Bayiz 1999 Job shop scheduling with beam search Eur. J. Oper. Res. 118 390 412
43. F. Guerriero M. Mancini R. Musmanno 2002 New rollout algorithms for combinatorial optimization Optim. Methods Softw. 17 727 654
44. S.S. Panwalkar W. Iskander 1977 A survey of scheduling rules Oper. Res. 25 1 45 61
45. J.H. Blackstone Jr. D.T. Phillips G.L. Hogg 1982 A state of the art survey of dispatching rules for manufacturing job-shop operations Int. J. Prod. Res. 20 27 45
46. R. Haupt 1989 A survey of priority rule based scheduling OR Spektrum 11 3 16
47. Bhaskaran, K., Pinedo, M.: Dispatching. In: Salvendy, G. (ed.) Handbook of Industrial Engineering, Chap. 83. Wiley, New York (1991)
48. Roy, B., Sussmann, B.: Les problémes d'ordonnancement avec constraints disjoinctives. Note DS No. 9 bis, SEMA, Paris, France (1964)
49. Lawrence, S.: Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques. GSIA, Carnegie Mellon Univ. Press, Pittsburgh (1984)