An improved tabu search approach for solving the job shop scheduling problem with tooling constraints

Discrete Applied Mathematics

Volumn 65, Issue 1-3, 1996, Pages 319-345

  Hertz, Alain ^a   Widmer, Marino ^b  

^a EPFL   (Switzerland)

^b UNIVERSITY OF FRIBOURG   (Switzerland)

Author keywords

Flexible manufacturing system; Job shop scheduling; Tabu search; Tooling constraints

Indexed keywords

EID: 0042261149     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00040-X     Document Type: Article

References (32)

1. J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Sci. 34 (1988) 391-401.
2. K.R. Baker, Introduction to Sequencing and Scheduling (Wiley, New York, 1974).
3. J.F. Bard, A heuristic for minimizing the number of tool switches on a flexible machine, IIE Trans. 20 (1988) 382-391.
4. J.W. Barnes and M. Laguna, A tabu search experience in production scheduling, Ann. Oper. Res. 41 (1993) 141-156.
5. M. Berrada and K.E. Stecke, A branch and bound approach for machine load balancing in flexible manufacturing systems, Management Sci. 32 (1986) 1316-1335.
6. Y. Crama, A.W.J. Kolen, A.G. Oerlemans and F.C.R. Spieksma, Minimizing the number of tool switches on a flexible machine, Internat. J. Flexible Manufacturing Systems 6 (1994) 33-54.
7. M. Dell'Amico and M. Trubian, Applying tabu search to the job-shop scheduling problem, Ann. Oper. Res. 41 (1993) 231-252.
8. D. de Werra and A. Hertz, Tabu search techniques: a tutorial and an application to neural networks, OR Spektum 11 (1989) 131-141.
9. D. de Werra and M. Widmer, Loading problems with tool management in flexible manufacturing systems: a few integer programming models, Internat. J. Flexible Manufacturing Systems 3 (1990) 71-82.
10. S. Fisher and G.L. Thompson, Probabilistic learning combinations of local job shop scheduling rules, in: J.F. Muth and G.L. Thompson, eds., Industrial Scheduling (Prentice-Hall, Englewood Cliffs, NJ, 1963) 225-251.
11. J.P. Follonier, On grouping parts and tools and balancing the workload on a flexible manufacturing system, Working paper ORWP 92/05, DMA-EPFL, Lausanne (1992).
12. J.P. Follonier, Minimization of the number of tool switches on a flexible manufacturing machine, Working Paper ORWP 92/13, DMA-EPFL, Lausanne (1992).
13. F. Glover, Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res. 13 (1986) 533-549.
14. F. Glover, Tabu search (part I), ORSA J. Comput. 1 (1989) 190-206.
15. F. Glover, Tabu search (part II), ORSA J. Comput. 2 (1990) 4-32.
16. F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Ann. Oper. Res. 41 (1993) 3-28.
17. P. Hansen, The steepest ascent mildest descent heuristic for combinatorial programming, presented at the congress on Numerical Methods in Combinatorial Optimization, Capri (1986).
18. A. Hertz and D. de Werra, The tabu search metaheuristic: how we used it, Ann. Math. Artificial Intelligence 1 (1990) 111-121.
19. A. Hertz, E. Taillard and D. de Werra, Tabu search, in: J.K. Lenstra, ed., Local Search in Combinatorial Optimization, Working Paper ORWP 92/18, DMA-EPFL, Lausanne (1992).
20. C.P. Koulamas, Total tool requirements in multi-level machining systems, Internat. J. Prod. Res. 29 (1991) 417-437.
21. S. Lawrence, Supplement to "Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques", GS7lA, Carnegie-Mellon University (1984).
22. Y. Mottet and M. Widmer, Dynamic scheduling and tool loading, in: V.C. Venkatesh and J.A. McGeough, eds., Computer-Aided Production Engineering (Elsevier, Amsterdam, 1991) 325-332.
23. E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job shop problem, Preprint 93/8, Instytut Cybernetyka Technicznej, Politechniki Wroclawskiej, Wroclaw (1993).
24. C. Privault, Modèles mathématiques pour la gestion off-line et on-line des changements d'outils sur une machine flexible, Thèse de doctorat, Université Joseph Fourier, Grenoble (1994).
25. C. Proust, J.N.D. Gupta and V. Deschamps, Flowshop scheduling with set-up, processing and removal times separated, Internat. J. Prod. Res. 29 (1991) 479-493.
26. B. Roy and B. Sussmann, Les problèmes d'ordonnancement avec contraintes disjonctives, Note DS n.9 bis, SEMA, Montrouge (1964).
27. E. Taillard, Parallel taboo search technique for the jobshop scheduling problem, ORSA J. Comput. 6 (1994) 108-117.
28. C.S. Tang and V. Denardo, Models arising from a flexible manufacturing machine: Part I: Minimization of the number of tool switches, Part II: Minimization of the number of switching instants, Oper. Res. 36 (1988) 767-784.
29. P.J.M. van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Oper. Res. 40 (1992) 113-125.
30. D. Veeramani, D.M. Upton and M.M. Barash, Cutting-tool management in computer-integrated manufacturing, Internat. J. Flexible Manufacturing Systems 3/4 (1992) 237-265.
31. M. Widmer, Job shop scheduling with tooling constraints: a tabu search approach, J. Oper. Res. Soc. 42 (1991) 75-82.
32. M. Widmer and A. Hertz, A new heuristic method for the flow shop sequencing problem, European J. Oper. Res. 41 (1989) 186-193.