{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:47:40Z","timestamp":1749221260767},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":[[2002,2]]},"DOI":"10.1016\/s0305-0548(00)00063-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"151-169","source":"Crossref","is-referenced-by-count":19,"title":["Fast parallel heuristics for the job shop scheduling problem"],"prefix":"10.1016","volume":"29","author":[{"given":"K.","family":"Steinh\u00f6fel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Albrecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.K.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0305-0548(00)00063-0_BIB1","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0204035","article-title":"Complexity results for multiprocessor scheduling under resource constraints","volume":"4","author":"Garey","year":"1975","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/S0305-0548(00)00063-0_BIB2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"Journal of Computer and System Science"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB3","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/opre.45.2.288","article-title":"Short shop schedules","volume":"45","author":"Williamson","year":"1997","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/S0305-0548(00)00063-0_BIB4","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1137\/S0097539794266407","article-title":"On unapproximable versions of NP-complete problems","volume":"25","author":"Zuckerman","year":"1996","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-7315(84)90004-2","article-title":"A parallel matching algorithm for convex bibartite graphs and applications to scheduling","volume":"1","author":"Dekel","year":"1984","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB6","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1137\/0216050","article-title":"The two processor scheduling is in random NC","volume":"16","author":"Vazirani","year":"1987","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB7","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1137\/0218076","article-title":"The two processor scheduling is in NC","volume":"18","author":"Helmbold","year":"1989","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB8","doi-asserted-by":"crossref","unstructured":"Jung H, Spirakis P, Serna M. A parallel algorithm for the two processor constrained scheduling. Proceedings of the 18th ICALP, 1991. p. 417\u201325.","DOI":"10.1007\/3-540-54233-7_152"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01955675","article-title":"An NC algorithm for finding the minimum weighted completion time schedule on series parallel graphs","volume":"16","author":"Sunder","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB10","doi-asserted-by":"crossref","unstructured":"ten Eikelder HMM, Aarts BJM, Verhoeven MGA, Aarts EHL. Sequential and parallel local search algorithms for job shop scheduling. In: Vobs, Martellos, Osmon IH, Roucairol C, editors. Meta-heuristics (advances and trends in local search paradigms for optimization). 1999. p. 359\u201371.","DOI":"10.1007\/978-1-4615-5775-3_25"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1018903912673","article-title":"Parallel branch-and-bound methods for the job-shop scheduling problem","volume":"83","author":"Perregaard","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB12","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\/S0305-0548(00)00063-0_BIB13","series-title":"Proceedings of RANDOM\u201998 Barcelona","first-page":"260","article-title":"On various cooling schedules for simulated annealing applied to the job shop problem","volume":"vol. 1518","author":"Steinh\u00f6fel","year":"1998"},{"issue":"3","key":"10.1016\/S0305-0548(00)00063-0_BIB14","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/S0377-2217(98)00326-9","article-title":"Two simulated annealing-based heuristics for the job shop scheduling problem","volume":"118","author":"Steinh\u00f6fel","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0305-0548(00)00063-0_BIB15","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(00)00063-0_BIB16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"13","author":"Hajek","year":"1988","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"10.1016\/S0305-0548(00)00063-0_BIB17","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1214\/aop\/1176989682","article-title":"Rough large deviation estimates for simulated annealing: applications to exponential schedules","volume":"20","author":"Catoni","year":"1992","journal-title":"Annals of Probability"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB18","unstructured":"Steinh\u00f6fel K, Albrecht A, Wong CK. On parallel heuristics for the job shop scheduling problem. In Zheng SQ, editor. Proeedings of 11th International Conference on Parallel and Distributed Computing and Systems, MIT: Cambridge, MA, November 3\u20136, 1999, p. 806\u201311."},{"key":"10.1016\/S0305-0548(00)00063-0_BIB19","unstructured":"Roy B, Sussmann B. Les probl\u00e8mes d'Ordonnancement avec Constraints Disjonctives. Note DS No.9 bis. SEMA, 1964."},{"key":"10.1016\/S0305-0548(00)00063-0_BIB20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB21","series-title":"Local search in combinatorial optimization","author":"Aarts","year":"1998"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB22","series-title":"Simulated annealing and Boltzmann machines: a stochastic approach","author":"Aarts","year":"1989"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB23","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0004-3702(90)90009-O","article-title":"On the parallel complexity of discrete relaxation in constraint satisfaction networks","volume":"45","author":"Kasif","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB24","series-title":"Proceedings of the 20th International Colloquium on Automata, Languages and Programming (ICALP)","first-page":"418","article-title":"Fast parallel constraint satisfaction","volume":"Vol. 700","author":"Kirousis","year":"1993"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB25","series-title":"Efficient parallel algorithms","author":"Gibbons","year":"1988"},{"issue":"1","key":"10.1016\/S0305-0548(00)00063-0_BIB26","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","article-title":"Parallel computation and conflicts in memory access","volume":"14","author":"Kucera","year":"1982","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB27","unstructured":"Muth JF, Thompson GL, Winters PR editors, Industrial Scheduling. Englewood Cliffs, NJ Prentice-Hall 1963."},{"key":"10.1016\/S0305-0548(00)00063-0_BIB28","unstructured":"Lawrence S. Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Technical Report. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania, 1984."},{"key":"10.1016\/S0305-0548(00)00063-0_BIB29","series-title":"Parallel problem solving from nature II","first-page":"281","article-title":"A genetic algorithm applicable to large-scale job shop problems","author":"Yamada","year":"1992"},{"key":"10.1016\/S0305-0548(00)00063-0_BIB30","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New search spaces for sequencing problems with application to job shop scheduling","volume":"38","author":"Storer","year":"1992","journal-title":"Management Science"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000630?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000630?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T16:21:30Z","timestamp":1580228490000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0305054800000630"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00063-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}