{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T04:26:04Z","timestamp":1768537564225,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,4,1]],"date-time":"1982-04-01T00:00:00Z","timestamp":386467200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1982,4]]},"DOI":"10.1016\/0167-6377(82)90046-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"56-58","source":"Crossref","is-referenced-by-count":122,"title":["Assembly line balancing as generalized bin packing"],"prefix":"10.1016","volume":"1","author":[{"given":"T.S.","family":"Wee","sequence":"first","affiliation":[]},{"given":"M.J.","family":"Magazine","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(82)90046-3_BIB1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","article-title":"Resource constrained scheduling as generalized bin packing","volume":"21","author":"Garey","year":"1976","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"10.1016\/0167-6377(82)90046-3_BIB2","series-title":"Analysis and Design of Algorithms in Combinatorial Optimization","first-page":"147","article-title":"Approximation algorithms for bin packing problems: A survey","author":"Garey","year":"1981"},{"issue":"2","key":"10.1016\/0167-6377(82)90046-3_BIB3","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\/0167-6377(82)90046-3_BIB4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/mnsc.2.3.261","article-title":"A computing procedure for a line balancing problem","volume":"13","author":"Jackson","year":"1956","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(82)90046-3_BIB5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","article-title":"Worst-case performance bounds for simple one-dimensional packing algorithms","volume":"3","author":"Johnson","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(82)90046-3_BIB6","article-title":"Fast algorithms for the assembly line balancing problem","author":"Magazine","year":"1981","journal-title":"University of Waterloo Paper"},{"key":"10.1016\/0167-6377(82)90046-3_BIB7","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 Res."},{"key":"10.1016\/0167-6377(82)90046-3_BIB8","article-title":"An efficient branch and bound algorithm for assembly line balancing \u2014 Part 1: Minimize the number of work stations","author":"Wee","year":"1981","journal-title":"University of Waterloo Working Paper"},{"key":"10.1016\/0167-6377(82)90046-3_BIB9","article-title":"An efficient branch and bound algorithm for assembly line balancing \u2014 Part 2: Maximize the production rate","author":"Wee","year":"1981","journal-title":"University of Waterloo Working Paper"},{"key":"10.1016\/0167-6377(82)90046-3_BIB10","series-title":"Technical Report STAN-CS-78-662","article-title":"New algorithms in bin packing","author":"Yao","year":"1978"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900463?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900463?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T11:52:01Z","timestamp":1552909921000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637782900463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,4]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,4]]}},"alternative-id":["0167637782900463"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(82)90046-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1982,4]]}}}