| Article ID: | iaor19982700 |
| Country: | United States |
| Volume: | 8 |
| Issue: | 3 |
| Start Page Number: | 302 |
| End Page Number: | 317 |
| Publication Date: | Jun 1996 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Lenstra Jan Karel, Aarts E.H.L., Vaessens R.J.M. |
| Keywords: | programming: integer |
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.