{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:20:54Z","timestamp":1771460454266,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000,1]]},"DOI":"10.1016\/s0377-2217(99)00158-7","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"297-310","source":"Crossref","is-referenced-by-count":135,"title":["A tabu search method guided by shifting bottleneck for the job shop scheduling problem"],"prefix":"10.1016","volume":"120","author":[{"given":"Ferdinando","family":"Pezzella","sequence":"first","affiliation":[]},{"given":"Emanuela","family":"Merelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00158-7_BIB1","unstructured":"E. Aarts, J.K. Lenstra, Local Search and Combinatorial Optimization, Wiley, New York, 1997"},{"key":"10.1016\/S0377-2217(99)00158-7_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(99)00158-7_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(99)00158-7_BIB4","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","article-title":"Machine sequencing via disjunctive graph: An implicit enumeration algorithm","volume":"17","author":"Balas","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB5","unstructured":"E. Balas, A. Vazacopoulos, Guided local search with shifting bottleneck for job shop scheduling, Tech. Rep., Management Science Research Report MSRR-609, GSIA Carnegie Mellon University, Pittsburgh, 1994"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"The one-machine sequencing problem","volume":"11","author":"Carlier","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00158-7_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(99)00158-7_BIB8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying tabu-search to the job-shop scheduling problem","volume":"4","author":"Dell'Amico","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB9","unstructured":"H. Fisher, G. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in: J. Muth, G. Thompson (Eds.), Industrial Scheduling, Prentice-Hall, Englewood Cliffs, NJ, 1963"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB10","unstructured":"S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop, Wiley, New York, 1982"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flow shop and job shop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB12","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search: Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search: Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB15","doi-asserted-by":"crossref","unstructured":"F. Glover, M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, 1997","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB16","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","article-title":"A block approach for single machine scheduling with release dates and due dates","volume":"26","author":"Grabowski","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB18","unstructured":"A. Hertz, E. Taillard, D. De Werra, Local search in combinatorial optimization, in: E. Aarts, J. Lenstra (Eds.), Tabu Search, vol. 5, Wiley, New York, (1997) pp. 121\u2013136"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB19","unstructured":"S. Lawrence, Supplement to, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, Tech. Rep., GSIA, Carnegie Mellon University, 1984"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB20","unstructured":"J. Lenstra, Sequencing by enumerative methods, Tech. Rep. Mathematical Centre Tract 69, Mathematisch Centrum, Amsterdam, 1976"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB21","unstructured":"H. Matsuo, C. Suh, R. Sullivan, A controlled search simulated annealing method for the general job-shop scheduling problem, Tech. Rep. 03-04-88, Dept. of Management, The University of Texas, Austin, 1988"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB22","unstructured":"T. Morton, D. Pentico, Heuristic Scheduling Systems, Wiley, New York, 1993"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB23","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB24","unstructured":"B. Roy, B. Sussman, Le probl\u00e8mes d'ordonnancement avec contraintes disjonctives, Note DS No. 9 bis, SEMA, Paris, 1964"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB25","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(99)00158-7_BIB26","doi-asserted-by":"crossref","unstructured":"R. Vaessens, E. Aarts, J. Lenstra, Job shop scheduling by local search, INFORMS Journal on Computing 8 (1996) 302, 317, 2nd revision","DOI":"10.1287\/ijoc.8.3.302"},{"key":"10.1016\/S0377-2217(99)00158-7_BIB27","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 Laarhoven","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:S0377221799001587?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001587?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T13:22:03Z","timestamp":1556112123000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799001587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0377221799001587"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00158-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}