Job shop scheduling by local search

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

Research output: Book/ReportReportAcademic

367 Downloads (Pure)

Abstract

We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. 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
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages21
Publication statusPublished - 1994

Publication series

NameMemorandum COSOR
Volume9405
ISSN (Print)0926-4493

Fingerprint

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

Cite this