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.
| Original language | English |
|---|---|
| Pages (from-to) | 302-317 |
| Number of pages | 16 |
| Journal | INFORMS Journal on Computing |
| Volume | 8 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1996 |
| Externally published | Yes |