{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T07:04:54Z","timestamp":1773299094508,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1016\/s0305-0548(96)00082-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"627-645","source":"Crossref","is-referenced-by-count":207,"title":["Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem"],"prefix":"10.1016","volume":"24","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"}]},{"given":"Christian","family":"J\u00fcrgens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00082-2_BIB1","series-title":"Cutting and Packing in Production and Distribution","author":"Dyckhoff","year":"1992"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB2","series-title":"Knapsack Problems","author":"Martello","year":"1990"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB3","series-title":"Algorithm Design for Computer System Design","first-page":"49","article-title":"Approximation algorithms for bin-packing\u2014an updated survey","author":"Coffman","year":"1984"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB4","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","article-title":"A state-of-the-art review of parallel-machine scheduling research","volume":"47","author":"Cheng","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB5","series-title":"Produktionsplanung\u2014Ablauforganisatorische Aspekte","author":"Domschke","year":"1993"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB6","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","article-title":"Using dual approximation algorithms for scheduling problems: theoretical and practical results","volume":"34","author":"Hochbaum","year":"1987","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-6377(94)00060-J","article-title":"An exact algorithm for the dual bin packing problem","volume":"17","author":"Labb\u00e9","year":"1995","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0305-0548(94)90059-0","article-title":"A branch-and-bound algorithm for the two-dimensional vector packing problem","volume":"21","author":"Spieksma","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB9","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB10","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 Journal on Computing"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0602019","article-title":"A tight asymptotic bound for next-fit-decreasing bin-packing","volume":"2","author":"Baker","year":"1981","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB12","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","article-title":"New worst-case results for the bin-packing problem","volume":"41","author":"Simchi-Levi","year":"1994","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/mnsc.17.5.259","article-title":"The loading problem","volume":"17","author":"Eilon","year":"1971","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/nav.3800250209","article-title":"An algorithm for a class of loading problems","volume":"25","author":"Hung","year":"1978","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB15","series-title":"Balancing and Sequencing of Assembly Lines","author":"Scholl","year":"1995"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB16","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/opre.39.4.616","article-title":"Capacitated vehicle routing on trees","volume":"39","author":"Labb\u00e9","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0377-2217(92)90208-Q","article-title":"Branch-and-bound algorithms for the multi-product assembly line balancing problem","volume":"58","author":"Berger","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","article-title":"Lower bounds and reduction procedures for the bin packing problem","volume":"28","author":"Martello","year":"1990","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB19","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":"2","author":"Jackson","year":"1956","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB20","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search: part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB21","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search: part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB22","series-title":"Modern Heuristic Techniques for Combinatorial Problems","first-page":"70","article-title":"Tabu search","author":"Glover","year":"1993"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB23","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF00127358","article-title":"Simple assembly line balancing\u2014heuristic approaches","volume":"2","author":"Scholl","year":"1996","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB24","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/0305-0548(94)90017-5","article-title":"Applying tabu search with influential diversification to multiprocessor scheduling","volume":"21","author":"H\u00fcbscher","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB25","doi-asserted-by":"crossref","unstructured":"Scholl, A. and Klein, R., SALOME: a bidirectional branch and bound procedure for assembly line balancing. INFORMS Journal on Computing (to appear).","DOI":"10.1287\/ijoc.9.4.319"},{"key":"10.1016\/S0305-0548(96)00082-2_BIB26","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0377-2217(95)00047-X","article-title":"Maximizing the production rate in simple assembly line balancing\u2014a branch and bound procedure","volume":"91","author":"Klein","year":"1996","journal-title":"European Journal of Operational Research"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000822?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000822?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:21:12Z","timestamp":1555190472000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":26,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0305054896000822"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00082-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}