Complex Sequencing Problems and Local Search Heuristics

P. Brucker, Johann L. Hurink

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Abstract

Many problems can be formulated as complex sequencing problems. We will present problems in flexible manufacturing that have such a formulation and apply local search methods like iterative improvement, simulated annealing and tabu search to solve these problems. Computational results are reported.
Original languageUndefined
Title of host publicationMeta-Heuristics: Theory and Applications
EditorsI.H. Osman, J.P. Kelly
Place of PublicationDordrecht
PublisherKluwer Academic Publishers
Pages151-166
Number of pages16
ISBN (Print)0792397002
Publication statusPublished - 1996

Keywords

  • EWI-7638

Cite this

Brucker, P., & Hurink, J. L. (1996). Complex Sequencing Problems and Local Search Heuristics. In I. H. Osman, & J. P. Kelly (Eds.), Meta-Heuristics: Theory and Applications (pp. 151-166). Dordrecht: Kluwer Academic Publishers.