{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:18:29Z","timestamp":1773883109367,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T00:00:00Z","timestamp":1509148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10951-017-0547-8","type":"journal-article","created":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T04:30:26Z","timestamp":1509165026000},"page":"127-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["The Current state of bounds on benchmark instances of the job-shop scheduling problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Jelke J.","family":"van Hoorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,28]]},"reference":[{"issue":"3","key":"547_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391\u2013401. \n                        https:\/\/doi.org\/10.1287\/mnsc.34.3.391\n                        \n                    .","journal-title":"Management Science"},{"issue":"2","key":"547_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate, D., & Cook, W. (1991). A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2), 149\u2013156. \n                        https:\/\/doi.org\/10.1287\/ijoc.3.2.149\n                        \n                    .","journal-title":"ORSA Journal on Computing"},{"key":"547_CR3","unstructured":"Beasley, J. E. (2014). OR-library. \n                        http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/files\/jobshop1.txt"},{"issue":"1","key":"547_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E Demirkol","year":"1998","unstructured":"Demirkol, E., Mehta, S., & Uzsoy, R. (1998). Benchmarks for shop scheduling problems. European Journal of Operational Research, 109(1), 137\u2013141. \n                        https:\/\/doi.org\/10.1016\/S0377-2217(97)00019-2\n                        \n                    .","journal-title":"European Journal of Operational Research"},{"key":"547_CR5","first-page":"225","volume-title":"Industrial scheduling, chapter 15","author":"H Fisher","year":"1963","unstructured":"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\u2013251). Englewood Cliffs: Prentice Hall."},{"issue":"2","key":"547_CR6","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"A Jain","year":"1999","unstructured":"Jain, A., & Meeran, S. (1999). Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research, 113(2), 390\u2013434. \n                        https:\/\/doi.org\/10.1016\/S0377-2217(98)00113-1\n                        \n                    .","journal-title":"European Journal of Operational Research"},{"key":"547_CR7","unstructured":"Lawrence, S. (1984). Resource constrained project scheduling. Technical report, Carnegie-Mellon University."},{"key":"547_CR8","unstructured":"Shylo, O. V. (2014) Job shop scheduling at Oleg V. Shylo: Personal webpage. \n                        http:\/\/optimizizer.com\/\n                        \n                    jobshop.php"},{"issue":"10","key":"547_CR9","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"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\u20131509. \n                        https:\/\/doi.org\/10.1287\/mnsc.38.10.1495\n                        \n                    .","journal-title":"Management Science"},{"issue":"2","key":"547_CR10","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278\u2013285. \n                        https:\/\/doi.org\/10.1016\/0377-2217(93)90182-M\n                        \n                    .","journal-title":"European Journal of Operational Research"},{"key":"547_CR11","unstructured":"Taillard, \u00c9. D. (2014). \u00c9ric Taillard\u2019s page. \n                        http:\/\/mistic.heig-vd.ch\/taillard\/problemes.dir\/ordonnancement.dir\/ordonnancement.html"},{"key":"547_CR12","unstructured":"van Hoorn, J. J. (2015). Job shop instances and solutions. \n                        http:\/\/jobshop.jjvh.nl"},{"key":"547_CR13","first-page":"281","volume-title":"Parallel instance solving from nature 2","author":"T Yamada","year":"1992","unstructured":"Yamada, T., & Nakano, R. (1992). A genetic algorithm applicable to large-scale job-shop instances. In R. M\u00e4nner & B. Manderick (Eds.), Parallel instance solving from nature 2 (pp. 281\u2013290). Amsterdam: Elsevier."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0547-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0547-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0547-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,13]],"date-time":"2018-02-13T03:35:45Z","timestamp":1518492945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0547-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,28]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["547"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0547-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,28]]}}}