Use this option if you have an account on informs.org or if you want to become an INFORMS member
Member Login
April 12, 2013 - April 13, 2026
April 12, 2013 - April 13, 2026
R. J. M. Vaessens
Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven
E. H. L. Aarts
Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, and Philips Research Laboratories, P.O. Box 80000, 5600 JA Eindhoven
J. K. Lenstra
Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, and CWI, P.O. Box 94079, 1090 GB Amsterdam
R. J. M. Vaessens
Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven
E. H. L. Aarts
Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, and Philips Research Laboratories, P.O. Box 80000, 5600 JA Eindhoven
J. K. Lenstra
Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven, and CWI, P.O. Box 94079, 1090 GB Amsterdam
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.
© 1996 INFORMS
