descriptionPublicationkeyboard_double_arrow_right Article 01 Aug 1996 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:INFORMS Journal on Computing, volume 8, pages 302-317 (issn: 1091-9856, eissn: 1526-5528,

Authors: Jan Karel Lenstra; Ehl Emile Aarts; Rjm Rob Vaessens;

doi: 10.1287/ijoc.8.3.302

Job Shop Scheduling by Local Search

- Summary
- Subjects
- Metrics

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.

Related Organizations

Eindhoven University of Technology
Netherlands
United States Air Force Research Laboratory
United States

Keywords

Deterministic scheduling theory in operations research, local search, job shop scheduling, survey

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	170
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%