{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T06:49:00Z","timestamp":1780987740751,"version":"3.54.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0377-2217(97)00019-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:15:26Z","timestamp":1027610126000},"page":"137-141","source":"Crossref","is-referenced-by-count":218,"title":["Benchmarks for shop scheduling problems"],"prefix":"10.1016","volume":"109","author":[{"given":"Ebru","family":"Demirkol","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjay","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reha","family":"Uzsoy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00019-2_BIB1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","article-title":"A computational study of local search algorithms for job shop scheduling","volume":"6","author":"Aarts","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job-shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of the job shop scheduling problem","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB4","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","article-title":"Machine sequencing via disjunctive graphs: An implicit enumeration approach","volume":"17","author":"Balas","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/mnsc.41.1.94","article-title":"One machine scheduling with delayed precedence constraints","volume":"41","author":"Balas","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB6","article-title":"Dispatching","author":"Bhaskaran","year":"1991"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB7","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB8","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1080\/00207549308956766","article-title":"A modified shifting bottleneck procedure for job shop scheduling","volume":"31","author":"Dauzere-Peres","year":"1993","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB9","series-title":"A computational study of shifting bottleneck methods for shop scheduling problems","author":"Demirkol","year":"1996"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB10","series-title":"Benchmarking for shop scheduling problems","author":"Demirkol","year":"19966"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB11","series-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB12","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1057\/jors.1996.78","article-title":"Machine criticality measures and subproblem solution procedures in shifting bottleneck methods: A computational study","volume":"47","author":"Holtsclaw","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB13","series-title":"Simulation Modeling and Analysis","author":"Law","year":"1991"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB14","article-title":"A controlled search simulated annealing method for the general jobshop scheduling problem","author":"Matsuo","year":"1988"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1142\/S0960313192000157","article-title":"A shifting bottleneck algorithm for scheduling semiconductor testing operations","volume":"2","author":"Ovacik","year":"1992","journal-title":"Journal of Electronics Manufacturing"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB16","article-title":"Decomposition methods for scheduling semiconductor testing facilities","author":"Ovacik","year":"1995","journal-title":"International Journal of Flexible Manufacturing Systems"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB17","series-title":"Scheduling: Theory, Algorithms and System","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB18","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New search spaces for sequencing problems with applications to job shop scheduling","volume":"38","author":"Storer","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB19","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB20","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","article-title":"Parallel taboo search techniques for the job shop scheduling problem","volume":"6","author":"Taillard","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00019-2_BIB21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","author":"Van Laarboven","year":"1992","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797000192?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797000192?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T10:57:23Z","timestamp":1556362643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797000192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0377221797000192"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00019-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}