Job shop scheduling by local search

E.H.L. Aarts, J.K. Lenstra, P.J.M. Laarhoven, van, N.L.J. Ulder

Research output: Book/ReportReportAcademic

225 Downloads (Pure)


We present a computational performance analysis of local search algorithms for job shop scheduling. The algorithms under investigation are iterative improvement, simulated annealing, threshold accepting and genetic local search. Our study shows that simulated annealing performs best in the sense that it finds better solutions than the other algorithms within the same amount of running time. Compared to more tailored algorithms, simulated annealing still finds the best results but only under the assumption that running time is of no concern.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages11
Publication statusPublished - 1992

Publication series

NameMemorandum COSOR
ISSN (Print)0926-4493


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

Cite this