Abstract
Scheduling problems have received considerable attention over the last decade. Several sets of benchmark instances are available for comparing the quality of the different methods developed. A large number of publications achieve either the current best known or improved bounds for a subset of these instances. It is unfortunate, however, that several publications erroneously reference the current state of these bounds. This article aims to provide an accurate overview of the current state of the bounds for eight sets of benchmark instances. In addition to careful reading of the references cited, in some instances the authors were contacted directly to verify these bounds. This was necessary when the bounds were not reported in the referenced work, or when the work was unavailable to me. The article also includes a brief overview of the techniques that were used to obtain these bounds.
This is a preview of subscription content, log in via an institution to check access.
References
Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391–401. https://doi.org/10.1287/mnsc.34.3.391.
Applegate, D., & Cook, W. (1991). A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2), 149–156. https://doi.org/10.1287/ijoc.3.2.149.
Beasley, J. E. (2014). OR-library. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files/jobshop1.txt
Demirkol, E., Mehta, S., & Uzsoy, R. (1998). Benchmarks for shop scheduling problems. European Journal of Operational Research, 109(1), 137–141. https://doi.org/10.1016/S0377-2217(97)00019-2.
Fisher, H., & Thompson, G. L. (1963). Probabilistic learning combinations of local job-shop scheduling rules. In J. F. Muth & G. L. Thompson (Eds.), Industrial scheduling, chapter 15 (pp. 225–251). Englewood Cliffs: Prentice Hall.
Jain, A., & Meeran, S. (1999). Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research, 113(2), 390–434. https://doi.org/10.1016/S0377-2217(98)00113-1.
Lawrence, S. (1984). Resource constrained project scheduling. Technical report, Carnegie-Mellon University.
Shylo, O. V. (2014) Job shop scheduling at Oleg V. Shylo: Personal webpage. http://optimizizer.com/jobshop.php
Storer, R. H., Wu, S. D., & Vaccari, R. (1992). New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38(10), 1495–1509. https://doi.org/10.1287/mnsc.38.10.1495.
Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278–285. https://doi.org/10.1016/0377-2217(93)90182-M.
Taillard, É. D. (2014). Éric Taillard’s page. http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/ordonnancement.html
van Hoorn, J. J. (2015). Job shop instances and solutions. http://jobshop.jjvh.nl
Yamada, T., & Nakano, R. (1992). A genetic algorithm applicable to large-scale job-shop instances. In R. Männer & B. Manderick (Eds.), Parallel instance solving from nature 2 (pp. 281–290). Amsterdam: Elsevier.
Author information
Authors and Affiliations
Corresponding author
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
van Hoorn, J.J. The Current state of bounds on benchmark instances of the job-shop scheduling problem. J Sched 21, 127–128 (2018). https://doi.org/10.1007/s10951-017-0547-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-017-0547-8