Job Shop Scheduling by Local Search
R. J. M. Vaessens, E. H. L. Aarts, J. K. Lenstra
INFORMS Journal on Computing · 1996 · Volume 8 · Issue 3
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
job shop scheduling, local search, heuristic search
Enable JavaScript for citation tools and additional paper interactions.