{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T12:52:07Z","timestamp":1770987127862,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4125,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0166-218x(01)00259-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"99-113","source":"Crossref","is-referenced-by-count":54,"title":["Optimally balancing assembly lines with different workstations"],"prefix":"10.1016","volume":"118","author":[{"given":"Gaia","family":"Nicosia","sequence":"first","affiliation":[]},{"given":"Dario","family":"Pacciarelli","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Pacifici","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00259-1_BIB1","series-title":"Modeling and Analysis of Manufacturing Systems","author":"Askin","year":"1993"},{"key":"10.1016\/S0166-218X(01)00259-1_BIB2","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/mnsc.32.8.909","article-title":"A survey of exact algorithms for the simple assembly line balancing problem","volume":"32","author":"Baybars","year":"1986","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. Math."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Canad. J. Math."},{"issue":"4","key":"10.1016\/S0166-218X(01)00259-1_BIB5","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1080\/00207548908942574","article-title":"A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems","volume":"27","author":"Ghosh","year":"1989","journal-title":"Internat. J. Production Res."},{"issue":"3","key":"10.1016\/S0166-218X(01)00259-1_BIB6","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1287\/opre.31.3.522","article-title":"An integer programming procedure for assembly system design problems","volume":"31","author":"Graves","year":"1983","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/S0166-218X(01)00259-1_BIB7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00713158","article-title":"Equipment selection and task assignment for multiproduct assembly system design","volume":"1","author":"Graves","year":"1988","journal-title":"Internat. J. Flexible Manuf. Systems"},{"key":"10.1016\/S0166-218X(01)00259-1_BIB8","doi-asserted-by":"crossref","unstructured":"S. Grewal, P. Tran, A. Bhaskare, Assembly planning research at CSIRO Australia, First International Symposium on Assembly and Task Planning ISATP 95, Pittsburgh, PA, August, 1995.","DOI":"10.1109\/ISATP.1995.518775"},{"issue":"2","key":"10.1016\/S0166-218X(01)00259-1_BIB9","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1287\/mnsc.11.2.308","article-title":"An algorithm for the line balancing problem","volume":"11","author":"Gutjahr","year":"1964","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB10","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/opre.11.3.442","article-title":"Assembly line balancing \u2014 dynamic programming with precedence constraints","volume":"11","author":"Held","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB11","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1080\/00207549008942835","article-title":"Assembly line balancing \u2014 a set of challenging problems","volume":"28","author":"Hoffmann","year":"1990","journal-title":"Internat. J. Production Res."},{"issue":"1","key":"10.1016\/S0166-218X(01)00259-1_BIB12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1287\/mnsc.38.1.39","article-title":"EUREKA: a hybrid system for assembly line balancing","volume":"38","author":"Hoffmann","year":"1992","journal-title":"Management Sci."},{"issue":"2","key":"10.1016\/S0166-218X(01)00259-1_BIB13","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/mnsc.34.2.240","article-title":"Optimally balancing large assembly lines with FABLE","volume":"34","author":"Johnson","year":"1988","journal-title":"Management Sci."},{"issue":"2","key":"10.1016\/S0166-218X(01)00259-1_BIB14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/opre.30.2.375","article-title":"On dynamic programming methods for assembly line balancing","volume":"30","author":"Kao","year":"1982","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB15","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0166-218X(01)00259-1_BIB16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF00167513","article-title":"A line-balancing strategy for designing flexible assembly systems","volume":"3","author":"Lee","year":"1991","journal-title":"Internat. J. Flexible Manuf. Systems"},{"key":"10.1016\/S0166-218X(01)00259-1_BIB17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-5316(91)90004-M","article-title":"Characteristics of optimal workload allocation for closed queueing networks","volume":"12","author":"Lee","year":"1991","journal-title":"Performance Evaluation"},{"issue":"1","key":"10.1016\/S0166-218X(01)00259-1_BIB18","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0278-6125(96)84212-9","article-title":"An integrated design support method for flexible assembly systems","volume":"15","author":"Lee","year":"1996","journal-title":"J. Manuf. Systems"},{"key":"10.1016\/S0166-218X(01)00259-1_BIB19","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1080\/07408179808966510","article-title":"Production planning for flexible flow systems with limited machine flexibility","volume":"30","author":"Lee","year":"1998","journal-title":"IIE Trans."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB20","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-5316(95)00005-4","article-title":"Throughput for production lines with serial work stations and parallel service facilities","volume":"25","author":"Magazine","year":"1996","journal-title":"Performance Evaluation"},{"key":"10.1016\/S0166-218X(01)00259-1_BIB21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0167-6377(91)90034-M","article-title":"Finding optimal line balances with OptPack","volume":"10","author":"Nourie","year":"1991","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/S0166-218X(01)00259-1_BIB22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/mnsc.44.1.103","article-title":"Assembly system design: a branch and cut approach","volume":"44","author":"Pinnoi","year":"1998","journal-title":"Management Sci."},{"issue":"5","key":"10.1016\/S0166-218X(01)00259-1_BIB23","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1080\/00207548108956687","article-title":"Branch and bound and heuristic procedures for assembly line balancing with paralleling of stations","volume":"19","author":"Pinto","year":"1981","journal-title":"Internat. J. Production Res."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB24","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1287\/mnsc.29.7.817","article-title":"Assembly line balancing with processing alternatives: an application","volume":"29","author":"Pinto","year":"1983","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB25","unstructured":"A. Scholl, Data of assembly line balancing problems, Schriften zur Quantitativen Betriebswirtschaftslehre 16\/93, TH Darmstadt, 1993."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB26","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/ijoc.9.4.319","article-title":"SALOME: a bidirectional branch-an-bound procedure for assembly line balancing","volume":"9","author":"Scholl","year":"1997","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB27","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.26.3.444","article-title":"Dynamic programming solution of sequencing problems with precedence constraints","volume":"26","author":"Schrage","year":"1978","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/S0166-218X(01)00259-1_BIB28","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/mnsc.32.4.430","article-title":"A comparative evaluation of heuristic line balancing techniques","volume":"32","author":"Talbot","year":"1986","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00259-1_BIB29","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0167-6377(82)90046-3","article-title":"Assembly line balancing as generalized bin packing","volume":"1","author":"Wee","year":"1982","journal-title":"Operations Research Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002591?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002591?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:57:14Z","timestamp":1556776634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002591"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0166218X01002591"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00259-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}