{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T22:37:25Z","timestamp":1718836645321},"reference-count":23,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":[[2003,12]]},"DOI":"10.1016\/s0305-0548(02)00128-4","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T14:52:27Z","timestamp":1046789547000},"page":"2157-2173","source":"Crossref","is-referenced-by-count":9,"title":["An experimental analysis of local minima to improve neighbourhood search"],"prefix":"10.1016","volume":"30","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":[{"key":"10.1016\/S0305-0548(02)00128-4_BIB1","unstructured":"Brucker P. http:\/\/www.mathematik.uni-osnabrueck.de\/research\/OR\/class\/."},{"issue":"4","key":"10.1016\/S0305-0548(02)00128-4_BIB2","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(02)00128-4_BIB3","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(02)00128-4_BIB4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0377-2217(97)00420-7","article-title":"Some new results on simulated annealing applied to the job shop scheduling problem","volume":"113","author":"Kolonko","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00128-4_BIB5","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.8.3.302","article-title":"Job shop scheduling by local search","volume":"8","author":"Vaessens","year":"1996","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/S0305-0548(02)00128-4_BIB6","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(02)00128-4_BIB7","doi-asserted-by":"crossref","unstructured":"Steinh\u00f6fel K, Albrecht A, Wong CK. On various cooling schedules for simulated annealing applied to the job shop problem. In: Luby M, Rolim J, Serna M, editors. Proceedings of RANDOM\u201998, Barcelona, Spain, Lecture Notes in Computer Science (LNCS), vol. 1518, 1998. p. 260\u201379.","DOI":"10.1007\/3-540-49543-6_21"},{"issue":"3","key":"10.1016\/S0305-0548(02)00128-4_BIB8","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"},{"key":"10.1016\/S0305-0548(02)00128-4_BIB9","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys D. Sequencing and scheduling: algorithms and complexity. In: Graves SS, Rinnooy Kan AHG, Zipkin P, editors. Handbooks in operations research and management science, vol. 4: logistics of production and inventory. New York: North-Holland, 1982. p. 445\u2013522."},{"key":"10.1016\/S0305-0548(02)00128-4_BIB10","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(02)00128-4_BIB11","unstructured":"Muth JF, Thompson GL, Winters PR, editors. Industrial scheduling. Englewood Cliffs, NJ: Prentice-Hall, 1963."},{"key":"10.1016\/S0305-0548(02)00128-4_BIB12","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(02)00128-4_BIB13","series-title":"Parallel problem solving from nature II","first-page":"281","article-title":"A generic algorithm applicable to large-scale job shop problems","author":"Yamada","year":"1992"},{"key":"10.1016\/S0305-0548(02)00128-4_BIB14","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"},{"key":"10.1016\/S0305-0548(02)00128-4_BIB15","unstructured":"Brinkk\u00f6tter W, Brucker P. Solving open benchmark problems for the job shop problem. Osnabr\u00fccker Schriften zur Mathematik, Reihe P, No. 212, 1999."},{"key":"10.1016\/S0305-0548(02)00128-4_BIB16","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","article-title":"Deterministic job shop scheduling","volume":"113","author":"Jain","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00128-4_BIB17","unstructured":"Caseau Y, Laburthe F. Disjunctive Scheduling with Task Intervals. Technical Report LIENS 95-25, Departement de Mathematiques et Informatique, Ecole Normale Superieure, Paris, France, 1995."},{"key":"10.1016\/S0305-0548(02)00128-4_BIB18","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\/S0305-0548(02)00128-4_BIB19","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"},{"key":"10.1016\/S0305-0548(02)00128-4_BIB20","series-title":"Evolutionary search and the job-shop","author":"Mattfeld","year":"1996"},{"key":"10.1016\/S0305-0548(02)00128-4_BIB21","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","article-title":"A computational study of local search algorithms for shop scheduling","volume":"6","author":"Aarts","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(02)00128-4_BIB22","doi-asserted-by":"crossref","unstructured":"Beck JC, Davenport AJ, Fox MS. Five pitfalls of empirical scheduling research. In: Proceedings of the CP, 1997. p. 390\u2013404.","DOI":"10.1007\/BFb0017455"},{"key":"10.1016\/S0305-0548(02)00128-4_BIB23","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1209\/0295-5075\/19\/6\/002","article-title":"Simulated tempering","volume":"19","author":"Marinari","year":"1992","journal-title":"Europhysics Letters"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001284?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001284?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T06:30:20Z","timestamp":1553668220000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":23,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0305054802001284"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00128-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}