{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T23:29:18Z","timestamp":1768865358697,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":[[1999,4]]},"DOI":"10.1016\/s0377-2217(98)00173-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:17:54Z","timestamp":1027599474000},"page":"50-58","source":"Crossref","is-referenced-by-count":88,"title":["Balancing assembly lines effectively \u2013 A computational comparison"],"prefix":"10.1016","volume":"114","author":[{"given":"Armin","family":"Scholl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00173-8_BIB1","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 Science"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB2","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1287\/mnsc.43.11.1485","article-title":"New benchmark results for the resource-constrained project scheduling problem","volume":"43","author":"Demeulemeester","year":"1997","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB3","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1287\/opre.37.6.916","article-title":"Fast, effective algorithms for simple assembly line balancing problems","volume":"37","author":"Hackman","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB4","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1287\/mnsc.9.4.551","article-title":"Assembly line balancing with a precedence matrix","volume":"9","author":"Hoffmann","year":"1963","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB5","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1080\/00207549008942835","article-title":"Assembly line balancing: A set of challenging problems","volume":"28","author":"Hoffmann","year":"1990","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB6","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 Science"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB7","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1287\/mnsc.39.10.1192","article-title":"Response to note on microcomputer performance of `FABLE' on Hoffmann's data sets","volume":"39","author":"Hoffmann","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1080\/00207548108956654","article-title":"Assembly line balancing algorithms: Computation comparisons","volume":"19","author":"Johnson","year":"1981","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB9","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 Science"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB10","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1287\/mnsc.39.10.1190","article-title":"Note: Microcomputer performance of `FABLE' on Hoffmann's data sets","volume":"39","author":"Johnson","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB11","doi-asserted-by":"crossref","first-page":"122","DOI":"10.19030\/jabr.v3i3.6522","article-title":"The packing heuristic for assembly line balancing","volume":"3","author":"Nourie","year":"1987","journal-title":"Journal of Applied Business Research"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB12","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":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB13","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1287\/mnsc.42.2.304","article-title":"Microcomputer performance of OptPack on Hoffmann's data sets: Comparison with Eureka and FABLE","volume":"42","author":"Nourie","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB14","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0377-2217(87)90276-1","article-title":"A two-process implicit enumeration algorithm for the simple assembly line balancing problem","volume":"32","author":"Saltzman","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB15","doi-asserted-by":"crossref","unstructured":"A. Scholl, Balancing and Sequencing of Assembly Lines, Physica, Heidelberg, 1995","DOI":"10.1007\/978-3-662-00861-4"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB16","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/ijoc.9.4.319","article-title":"SALOME: A bidirectional branch-and-bound procedure for assembly line balancing","volume":"9","author":"Scholl","year":"1997","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB17","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":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/mnsc.30.1.85","article-title":"An integer programming algorithm with network cuts for solving the assembly line balancing problem","volume":"30","author":"Talbot","year":"1984","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB19","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 Science"},{"key":"10.1016\/S0377-2217(98)00173-8_BIB20","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0377-2217(79)90100-0","article-title":"An optimal procedure for the single-model deterministic assembly line balancing problem","volume":"3","author":"Van Assche","year":"1979","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798001738?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798001738?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T21:20:05Z","timestamp":1556659205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798001738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0377221798001738"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00173-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}