Improving local search heuristics for some scheduling problems - I

Discrete Applied Mathematics

Volumn 65, Issue 1-3, 1996, Pages 97-122

  Brucker, Peter ^a   Hurink, Johann ^a   Werner, Frank ^b  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (12)

1. D. de Werra and A Hertz, Tabu search techniques: a tutorial and an application to neural networks, OR Spectrum 11 (1989) 131-141.
2. J. Du and J.Y.-T. Leung, Minimizing total tardiness on one machine is NP-hard, Math. Oper. Res. 15 (1990) 483-495.
3. F. Glover, Tabu search, Part I, ORSA J. Comput. 1 (1989) 190-206.
4. F. Glover, Tabu search, Part II, ORSA J. Comput. 2 (1990) 4-32.
5. E. Lawler, A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness, Ann. Discrete Math. 1 (1977) 331-342.
6. E. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Ann. Discrete Math. 2 (1978) 75-90.
7. O. Martin, S.W. Otto and E.W. Felten, Large-step Markov chains for the TSP incorporating local search heuristics, Oper. Res. Lett. 11 (1992) 219-224.
8. A.H.G. Rinnooy Kan, B.J. Lageweg and J.K. Lenstra, Minimizing total costs in one-machine scheduling, Oper. Res. 23 (1975) 908-927.
9. M. Thole, Lösung von multi-purpose Job-Shop Problemen durch Tabu-Suche, Diplomarbeit, Fachbereich Mathematik/Informatik, Universität Osnabrück (1993).
10. N.L.J. Ulder, Genetic local search: a population-based search algorithm, Master's Thesis, Eindhoven University of Technology (1990).
11. P.J.M. Van Laarhoven and E.H.L. Aarts, Simulated Annealing; Theory and Applications (Reidel, Dordrecht, 1987).
12. 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.