{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T23:20:22Z","timestamp":1770506422009,"version":"3.49.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100010261","name":"Fok Ying Tung Education Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60274049"],"award-info":[{"award-number":["60274049"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["70171030"],"award-info":[{"award-number":["70171030"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["70425003"],"award-info":[{"award-number":["70425003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People&apos;s Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2006,11]]},"DOI":"10.1016\/j.cor.2005.03.028","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:36Z","timestamp":1115393676000},"page":"3344-3359","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":76,"title":["A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time"],"prefix":"10.1016","volume":"33","author":[{"given":"Lixin","family":"Tang","sequence":"first","affiliation":[]},{"given":"Hua","family":"Xuan","sequence":"additional","affiliation":[]},{"given":"Jiyin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cor.2005.03.028_bib1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1080\/00207540110073000","article-title":"Steel-making process scheduling using Lagrangian relaxation","volume":"40","author":"Tang","year":"2002","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cor.2005.03.028_bib2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimisation and approximation in deterministic sequencing and scheduling","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/j.cor.2005.03.028_bib3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/j.cor.2005.03.028_bib4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","article-title":"Hybrid flow shop scheduling","volume":"37","author":"Linn","year":"1999","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/j.cor.2005.03.028_bib5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0925-5273(99)00051-1","article-title":"A branch-and-bound algorithm for the hybrid flowshop","volume":"64","author":"Moursli","year":"2000","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.cor.2005.03.028_bib6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0925-5273(99)00048-1","article-title":"Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness","volume":"64","author":"Botta-Genoulaz","year":"2000","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.cor.2005.03.028_bib7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1018976827443","article-title":"Scheduling a two-stage hybrid flow shop with parallel machines at the first stage","volume":"69","author":"Gupta","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.cor.2005.03.028_bib8","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1016\/S0305-0548(01)00040-5","article-title":"Heuristics for hybrid flow shops with controllable processing times and assignable due dates","volume":"29","author":"Gupta","year":"2002","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.cor.2005.03.028_bib9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/(SICI)1099-1425(200003\/04)3:2<89::AID-JOS36>3.0.CO;2-N","article-title":"Heuristics for minimizing total weighted tardiness in flexible flow shops","volume":"3","author":"Yang","year":"2000","journal-title":"Journal of Scheduling"},{"issue":"1","key":"10.1016\/j.cor.2005.03.028_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"},{"key":"10.1016\/j.cor.2005.03.028_bib11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1018970020599","article-title":"Scheduling permutation flow shops using the Lagrangian relaxation technique","volume":"70","author":"Liu","year":"1997","journal-title":"Annals of Operations Research"},{"issue":"7","key":"10.1016\/j.cor.2005.03.028_bib12","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1109\/9.231461","article-title":"Scheduling of manufacturing systems using the Lagrangian relaxation technique","volume":"38","author":"Luh","year":"1993","journal-title":"IEEE Transaction on Automatic Control"},{"key":"10.1016\/j.cor.2005.03.028_bib13","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/S0377-2217(02)00470-8","article-title":"An alternative framework to Lagrangian relaxation approach for job shop scheduling","volume":"149","author":"Chen","year":"2003","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/j.cor.2005.03.028_bib14","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","article-title":"Scheduling independent tasks on parallel processors","volume":"12","author":"Rothkopf","year":"1966","journal-title":"Management Science"},{"key":"10.1016\/j.cor.2005.03.028_bib15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and scheduling problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Science"},{"key":"10.1016\/j.cor.2005.03.028_bib16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-6377(92)90035-2","article-title":"A new dynamic programming algorithm for the parallel machines total weighted completion time problem","volume":"11","author":"Lee","year":"1992","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.cor.2005.03.028_bib17","unstructured":"O\u011fuz C, Tang L. A Lagrangian relaxation method for hybrid flow-shop scheduling with multiprocessor tasks to minimize total weighted completion time. Proceedings of the 1st multidisciplinary international conference on scheduling: theory and applications, Nottingham, UK, August 2003. p. 638\u201353."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054805001231?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054805001231?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T07:47:11Z","timestamp":1759650431000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054805001231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11]]},"references-count":17,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["S0305054805001231"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2005.03.028","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2006,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2005.03.028","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2005 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}