{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:57:15Z","timestamp":1761487035541},"reference-count":25,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T00:00:00Z","timestamp":1096588800000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,10]]},"DOI":"10.1016\/s0305-0548(03)00243-0","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T21:31:23Z","timestamp":1063747883000},"page":"2093-2110","source":"Crossref","is-referenced-by-count":41,"title":["An improved shifting bottleneck procedure for the job shop scheduling problem"],"prefix":"10.1016","volume":"31","author":[{"given":"Huang","family":"Wenqi","sequence":"first","affiliation":[]},{"given":"Yin","family":"Aihua","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00243-0_BIB1","series-title":"Deterministic and stochastic scheduling","first-page":"p35","article-title":"Recent developments in deterministic sequencing and scheduling: a survey","author":"Lawler","year":"1982"},{"issue":"2","key":"10.1016\/S0305-0548(03)00243-0_BIB2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of job-shop scheduling","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA Journal of Computer"},{"key":"10.1016\/S0305-0548(03)00243-0_BIB3","unstructured":"Brucker P, Jurish B, Sieviers B. A fast branch & bound algorithm for the job-shop problem. Report, Universit\u00e4t Osnabr\u00fcck, Germany, 1991."},{"issue":"2","key":"10.1016\/S0305-0548(03)00243-0_BIB4","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\/S0305-0548(03)00243-0_BIB5","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/mnsc.24.4.441","article-title":"Job-shop scheduling by implicit enumeration","volume":"24","author":"Lageweg","year":"1977","journal-title":"Management Science"},{"issue":"6","key":"10.1016\/S0305-0548(03)00243-0_BIB6","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1080\/00207547908919634","article-title":"Job-shop scheduling heuristics with local neighborhood search","volume":"17","author":"Spachis","year":"1979","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(03)00243-0_BIB7","series-title":"Sequencing and scheduling: an introduction to the mathematics of the job-shop","author":"French","year":"1982"},{"key":"10.1016\/S0305-0548(03)00243-0_BIB8","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"},{"issue":"1","key":"10.1016\/S0305-0548(03)00243-0_BIB9","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"},{"key":"10.1016\/S0305-0548(03)00243-0_BIB10","unstructured":"Matsuo HC, Suh CJ, Sullivan RS. A controlled search simulated annealing method for general job shop scheduling problem. Working Paper, 03-04-88, Department of Management, The University of Texas at Austin, Austin, TX, 1988."},{"issue":"1\u20134","key":"10.1016\/S0305-0548(03)00243-0_BIB11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying tabu-search to job-shop scheduling problem","volume":"41","author":"Dell'Amico","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(03)00243-0_BIB12","doi-asserted-by":"crossref","unstructured":"Dongarra JJ. Performance of various computers using standard linear equations software. Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN, 1993.","DOI":"10.2528\/PIER91010101"},{"key":"10.1016\/S0305-0548(03)00243-0_BIB13","unstructured":"Taillard E. Parallel taboo search technique for the job shop scheduling problem. Working Paper ORWP 89\/11 (received version October 1992), Department de Mathematiques, Ecole Polytechnique Federale De Lausanne, Lausanne, Switzerland, 1989."},{"key":"10.1016\/S0305-0548(03)00243-0_BIB14","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 Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(03)00243-0_BIB15","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","article-title":"Guided local search with shifting bottleneck for job shop scheduling","volume":"44","author":"Balas","year":"1988","journal-title":"Management Science"},{"issue":"6","key":"10.1016\/S0305-0548(03)00243-0_BIB16","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 scheduling problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(03)00243-0_BIB17","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0377-2217(99)00158-7","article-title":"A tabu search method guided by shifting bottleneck for job shop scheduling problem","volume":"120","author":"Pezzella","year":"2000","journal-title":"European Journal of Operations Research"},{"issue":"10","key":"10.1016\/S0305-0548(03)00243-0_BIB18","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New search space for sequencing probl\u00e8ms with application to job shop scheduling","volume":"39","author":"Storer","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(03)00243-0_BIB19","unstructured":"Roy B, Sussman B. Les probl\u00e9mes d'ordonnancement avec contraintes disjonctives. Note DS NO.9 bis, SEMA, Pairs; 1964."},{"key":"10.1016\/S0305-0548(03)00243-0_BIB20","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\/S0305-0548(03)00243-0_BIB21","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","article-title":"Evolution based learning in a job shop scheduling environment","volume":"22","author":"Dorndorf","year":"1995","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(03)00243-0_BIB22","unstructured":"Vaessens RJM, Aarts EHL, Lenstra JK. Job shop scheduling by local search. Memorandum COSOR 94-5, Eindhoven University of Techonlogy, Department of Mathematics and Computing Science, Eindhoven, The Netherlands, 1994."},{"key":"10.1016\/S0305-0548(03)00243-0_BIB23","unstructured":"Eck B, Pinedo M. Good solution to job scheduling problems via tabu search. Presented at Joint ORSA\/TIMS Meeting, Vancouver, Canada, May, 10, 1989."},{"key":"10.1016\/S0305-0548(03)00243-0_BIB24","unstructured":"Fisher H, Thompson DL. Probabilistic learning combinations of local job shop scheduling rules. In: Muth JF, Thompson GL, editors. Industrial scheduling. Englewood Cliffs, NJ: Prentice-Hall; 1963."},{"key":"10.1016\/S0305-0548(03)00243-0_BIB25","unstructured":"Lawrence S. Supplement to i\u00b0Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, i\u00b1GSIA, Carnegie Mellon University, Pittsburgh, PA, 1984."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803002430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803002430?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:02:50Z","timestamp":1682550170000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803002430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10]]},"references-count":25,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2004,10]]}},"alternative-id":["S0305054803002430"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00243-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,10]]}}}