Job Shop Scheduling by Local Search (March 1994)

摘要

We survey solution methods for the job shop scheduling problem with an emphasison local search. We discuss both deterministic 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.