Abstract
We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic 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.
| Original language | English |
|---|---|
| Place of Publication | Eindhoven |
| Publisher | Technische Universiteit Eindhoven |
| Publication status | Published - 1994 |
| Externally published | Yes |
Publication series
| Name | Memorandum COSOR |
|---|