Job shop scheduling by local search

R.J.M. Vaessens, E.H.L. Aarts, J.K. Lenstra

Research output: Contribution to journalArticleScientificpeer-review

164 Citations (Scopus)

Abstract

We survey solution methods for the job shop scheduling problem with an emphasis on local search. Both deterministic and randomized local search methods as well as the proposed neighborhoods are discussed. We compare the computational performance of the various methods in terms of their effectiveness and efficiency on a standard set of problem instances.
Original languageEnglish
Pages (from-to)302-317
Number of pages16
JournalINFORMS Journal on Computing
Volume8
Issue number3
DOIs
Publication statusPublished - 1996
Externally publishedYes

Fingerprint Dive into the research topics of 'Job shop scheduling by local search'. Together they form a unique fingerprint.

  • Cite this