{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T19:14:18Z","timestamp":1770578058114,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":[[2000,6]]},"DOI":"10.1016\/s0377-2217(99)00108-3","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"504-518","source":"Crossref","is-referenced-by-count":22,"title":["A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints"],"prefix":"10.1016","volume":"123","author":[{"given":"Moon-Won","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeong-Dae","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00108-3_BIB1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0278-6125(97)85675-0","article-title":"Scheduling for IC sort and test facilities with precedence constraints via Lagrangian relaxation","volume":"16","author":"Chen","year":"1997","journal-title":"Journal of Manufacturing Systems"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB2","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/mnsc.6.4.475","article-title":"Optimal policies for a multi-echelon inventory problem","volume":"6","author":"Clark","year":"1960","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/70.282535","article-title":"Scheduling products with bill of materials using an improved Lagrangian relaxation technique","volume":"10","author":"Czerwinski","year":"1994","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method for solving integer programming problem","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB5","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","article-title":"An applications oriented guide to Lagrangian relaxation","volume":"15","author":"Fisher","year":"1985","journal-title":"Interfaces"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB6","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0377-2217(90)90087-R","article-title":"Job oriented production scheduling","volume":"47","author":"Hastings","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB8","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0377-2217(96)00312-8","article-title":"A branch and bound algorithm for the two-stage assembly scheduling problem","volume":"103","author":"Hariri","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01585935","article-title":"Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems","volume":"70","author":"Hoogeveen","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01585876","article-title":"Scheduling by positional completion times: Analysis of a two-stage flow shop problem with batching machine","volume":"82","author":"Hoogeveen","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB11","first-page":"1751","article-title":"On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems","volume":"25","author":"Kim","year":"1987","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0305-0548(94)E0019-4","article-title":"A backward approach in list scheduling algorithms for multi-machine tardiness problems","volume":"22","author":"Kim","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB13","first-page":"71","article-title":"Evaluating backward scheduling and sequencing rules for an assembly shop environment","volume":"36","author":"Lalsare","year":"1995","journal-title":"Production and Inventory Management Journal"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB14","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","article-title":"Minimizing the makespan in the 3-machine assembly type flowshop scheduling problem","volume":"39","author":"Lee","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB15","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 Transactions on Automatic Control"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB16","doi-asserted-by":"crossref","unstructured":"Park, M.-W., Kim, Y.-D., 1999. A heuristic algorithm for a production scheduling problem in an assembly system, Journal of the Operational Research Society 50, 138\u2013147","DOI":"10.1057\/palgrave.jors.2600683"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB17","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.43.2.346","article-title":"The two-stage assembly scheduling problem: Complexity and approximation","volume":"43","author":"Potts","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00108-3_BIB18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001083?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001083?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T03:28:54Z","timestamp":1555298934000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799001083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0377221799001083"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00108-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}