{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:37Z","timestamp":1759847557128},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":9329,"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":[[1988]]},"DOI":"10.1016\/0166-218x(88)90089-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"143-148","source":"Crossref","is-referenced-by-count":30,"title":["Online variable-sized bin packing"],"prefix":"10.1016","volume":"22","author":[{"given":"Nancy G.","family":"Kinnerseley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90089-3_BIB1","series-title":"Tech. Rept. R-864","article-title":"A lower bound for on-line one-dimensional bin packing algorithms","author":"Brown","year":"1979"},{"key":"10.1016\/0166-218X(88)90089-3_BIB2","series-title":"Algorithm Design for Computer Systems Design","first-page":"49","article-title":"Approximation algorithms for bin packing: An updated survey","author":"Coffman","year":"1984"},{"key":"10.1016\/0166-218X(88)90089-3_BIB3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0020-0190(84)90010-3","article-title":"A storage size selection problem","volume":"18","author":"Friesen","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(88)90089-3_BIB4","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0215016","article-title":"Variable sized bin packing","volume":"15","author":"Friesen","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90089-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\/0166-218X(88)90089-3_BIB6","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","article-title":"Fast algorithms for bin packing","volume":"8","author":"Johnson","year":"1974","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0166-218X(88)90089-3_BIB7","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1057\/jors.1987.91","article-title":"A study of composite heuristic algorithms","volume":"38","author":"Langston","year":"1987","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0166-218X(88)90089-3_BIB8","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0020-0190(80)90077-0","article-title":"A lower bound for on-line bin packing","volume":"10","author":"Liang","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(88)90089-3_BIB9","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","article-title":"A simple on-line bin packing algorithm","volume":"32","author":"Lee","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(88)90089-3_BIB10","series-title":"Tech. Rept. CSRL-83-12","article-title":"A linear on-line bin packing algorithm","author":"Martel","year":"1983"},{"key":"10.1016\/0166-218X(88)90089-3_BIB11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/0216012","article-title":"An efficient approximation scheme for variable-sized bin packing","volume":"16","author":"Murgolo","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90089-3_BIB12","series-title":"Tech. Rept. R-1003","article-title":"On-line bin packing in linear time","author":"Ramanan","year":"1983"},{"key":"10.1016\/0166-218X(88)90089-3_BIB13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","article-title":"New algorithms for bin packing","volume":"27","author":"Yao","year":"1980","journal-title":"J. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900893?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900893?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:50:34Z","timestamp":1555116634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88900893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988]]}},"alternative-id":["0166218X88900893"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90089-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988]]}}}