{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:16:40Z","timestamp":1771024600227,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":[[2003,9]]},"DOI":"10.1016\/s0377-2217(02)00470-8","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T20:08:04Z","timestamp":1054584484000},"page":"499-512","source":"Crossref","is-referenced-by-count":78,"title":["An alternative framework to Lagrangian relaxation approach for job shop scheduling"],"prefix":"10.1016","volume":"149","author":[{"given":"Haoxun","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter B.","family":"Luh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0377-2217(02)00470-8_BIB1","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(02)00470-8_BIB2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207548208947745","article-title":"A state-of-the-art survey of dispatching rules for manufacturing job shop operations","volume":"20","author":"Blackstone","year":"1982","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00470-8_BIB3","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"},{"issue":"5","key":"10.1016\/S0377-2217(02)00470-8_BIB4","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/70.720354","article-title":"An improvement of the lagrangian relaxation approach for job shop scheduling: A dynamic programming method","volume":"14","author":"Chen","year":"1998","journal-title":"IEEE Transaction on Robotics and Automation"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB5","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","article-title":"Solving parallel machine scheduling problems by column","volume":"11","author":"Chen","year":"1999","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying Tabu Search to the job-shop scheduling problem","volume":"41","author":"Dell\u2019Amico","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB7","series-title":"International Conference on Robotics and Automation, CA","first-page":"824","article-title":"A genetic algorithm for job shop","author":"Falkenuer","year":"1991"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB8","series-title":"Proceedings of the Fifth International Conference of Genetic Algorithm and Their Applications","first-page":"375","article-title":"A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems","author":"Fang","year":"1993"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB9","series-title":"Industrial Scheduling","article-title":"Probabilistic learning combinations of local job-shop scheduling rules","author":"Fisher","year":"1963"},{"issue":"1","key":"10.1016\/S0377-2217(02)00470-8_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/70.210791","article-title":"A practical approach to job shop scheduling problems","volume":"9","author":"Hoitomt","year":"1993","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"1","key":"10.1016\/S0377-2217(02)00470-8_BIB11","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\/S0377-2217(02)00470-8_BIB12","series-title":"Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","article-title":"Sequencing and scheduling: Algorithms and complexity","volume":"vol. 4","author":"Lawler","year":"1993"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB13","first-page":"720","article-title":"Evolution programs for job-shop scheduling","volume":"vol. 1","author":"Mesghouni","year":"1997"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB14","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(02)00470-8_BIB15","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","article-title":"A computational study of constraint satisfaction for multiple capacitated job shop scheduling","volume":"90","author":"Nuitjen","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","article-title":"A survey of scheduling rules","volume":"25","author":"Panwalkar","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB17","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0377-2217(87)80008-5","article-title":"Dynamic programming and decomposition approaches for the single machine total tardiness problem","volume":"32","author":"Potts","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","article-title":"Scheduling with limited machine availability","volume":"121","author":"Schmidt","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00470-8_BIB19","first-page":"241","article-title":"An optimization-based algorithm for job shop scheduling, SADHANA","volume":"22","author":"Wang","year":"1997","journal-title":"Special Issue on Competitive Manufacturing Systems"},{"issue":"3","key":"10.1016\/S0377-2217(02)00470-8_BIB20","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1023\/A:1022646725208","article-title":"The surrogate gradient algorithm for Lagrangian relaxation method","volume":"100","author":"Zhao","year":"1999","journal-title":"Journal of Optimization Theory and Applications"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004708?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004708?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T01:51:57Z","timestamp":1553133117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702004708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0377221702004708"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00470-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}