Job Shop Scheduling by Local Search
- 1 August 1996
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 8 (3) , 302-317
- https://doi.org/10.1287/ijoc.8.3.302
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.Keywords
This publication has 0 references indexed in Scilit: