{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:28:40Z","timestamp":1774952920791,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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 & Operations Research"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0305-0548(00)00082-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"821-839","source":"Crossref","is-referenced-by-count":128,"title":["New heuristics for one-dimensional bin-packing"],"prefix":"10.1016","volume":"29","author":[{"given":"Krzysztof","family":"Fleszar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalil S.","family":"Hindi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00082-4_BIB1","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"7","key":"10.1016\/S0305-0548(00)00082-4_BIB2","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","article-title":"BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem","volume":"24","author":"Scholl","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00082-4_BIB3","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1023\/A:1018952112615","article-title":"Exact solution of bin-packing problems using column generation and branch-and-bound","volume":"86","author":"Val\u00e9rio de Carvalho","year":"1999","journal-title":"Annals of Operations Research"},{"issue":"6","key":"10.1016\/S0305-0548(00)00082-4_BIB4","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1080\/095372899232894","article-title":"A new heuristic algorithm for the one-dimensional bin-packing problem","volume":"10","author":"Gupta","year":"1999","journal-title":"Production Planning & Control"},{"key":"10.1016\/S0305-0548(00)00082-4_BIB5","doi-asserted-by":"crossref","unstructured":"Fekete SP, Schepers J. New classes of lower bounds for bin packing problems, Lecture Notes in Computer Science, vol. 1412. Berlin: Springer, 1998. p. 257\u201370.","DOI":"10.1007\/3-540-69346-7_20"},{"key":"10.1016\/S0305-0548(00)00082-4_BIB6","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\/S0305-0548(00)00082-4_BIB7","series-title":"Knapsack problems","author":"Martello","year":"1990"},{"key":"10.1016\/S0305-0548(00)00082-4_BIB8","doi-asserted-by":"crossref","unstructured":"Kolisch R, Hartmann S. Heuristic algorithms for the resource-constrainted project scheduling problem: classification and computational analysis. In: W\u0229glarz J editor. Project scheduling: recent models, algorithms and applications. Dordrecht: Kluwer, 1999.","DOI":"10.1007\/978-1-4615-5533-9_7"},{"key":"10.1016\/S0305-0548(00)00082-4_BIB9","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N. An introduction to variable neighbourhood search. In: S. Voss et al., editors. Metaheuristics, advances and trends in local search paradigms for optimization. Dordrecht: Kluwer, 1999. p. 433\u201358.","DOI":"10.1007\/978-1-4615-5775-3_30"},{"issue":"11","key":"10.1016\/S0305-0548(00)00082-4_BIB10","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighbourhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Computers & Operations Research"},{"issue":"11","key":"10.1016\/S0305-0548(00)00082-4_BIB11","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-library: distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"Journal of the Operational Research Society"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000824?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000824?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:27:53Z","timestamp":1556522873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":11,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0305054800000824"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00082-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}