Job shop scheduling by local search

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

Research output: Contribution to journalArticleScientificpeer-review

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

Job shop scheduling
Local search
Local search (optimization)

Cite this

Vaessens, R.J.M. ; Aarts, E.H.L. ; Lenstra, J.K. / Job shop scheduling by local search. In: INFORMS Journal on Computing. 1996 ; Vol. 8, No. 3. pp. 302-317.
@article{ab390b61fed048d3a705c287ecfc6078,
title = "Job shop scheduling by local search",
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.",
author = "R.J.M. Vaessens and E.H.L. Aarts and J.K. Lenstra",
year = "1996",
doi = "10.1287/ijoc.8.3.302",
language = "English",
volume = "8",
pages = "302--317",
journal = "INFORMS Journal on Computing",
issn = "1091-9856",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "3",

}

Job shop scheduling by local search. / Vaessens, R.J.M.; Aarts, E.H.L.; Lenstra, J.K.

In: INFORMS Journal on Computing, Vol. 8, No. 3, 1996, p. 302-317.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Job shop scheduling by local search

AU - Vaessens, R.J.M.

AU - Aarts, E.H.L.

AU - Lenstra, J.K.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

U2 - 10.1287/ijoc.8.3.302

DO - 10.1287/ijoc.8.3.302

M3 - Article

VL - 8

SP - 302

EP - 317

JO - INFORMS Journal on Computing

JF - INFORMS Journal on Computing

SN - 1091-9856

IS - 3

ER -