{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T03:19:18Z","timestamp":1769224758742,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1016\/0196-6774(89)90031-x","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"305-326","source":"Crossref","is-referenced-by-count":106,"title":["On-line bin packing in linear time"],"prefix":"10.1016","volume":"10","author":[{"given":"Prakash","family":"Ramanan","sequence":"first","affiliation":[]},{"given":"Donna J","family":"Brown","sequence":"additional","affiliation":[]},{"given":"C.C","family":"Lee","sequence":"additional","affiliation":[]},{"given":"D.T","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(89)90031-X_BIB1","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1137\/0212033","article-title":"Shelf algorithms for two-dimensional packing problems","volume":"12","author":"Baker","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(89)90031-X_BIB2","article-title":"A Lower Bound for On-line One-dimensional Bin Packing Algorithms","author":"Brown","year":"1979"},{"key":"10.1016\/0196-6774(89)90031-X_BIB3","unstructured":"D. J. Brown, draft, 1980."},{"key":"10.1016\/0196-6774(89)90031-X_BIB4","series-title":"Algorithm Design for Computer System Design","article-title":"Approximation algorithms for bin packing\u2014An updated survey","author":"Coffman","year":"1984"},{"key":"10.1016\/0196-6774(89)90031-X_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(89)90031-X_BIB6","article-title":"Near-optimal Bin Packing Algorithms","author":"Johnson","year":"1973"},{"key":"10.1016\/0196-6774(89)90031-X_BIB7","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. System Sci."},{"key":"10.1016\/0196-6774(89)90031-X_BIB8","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\/0196-6774(89)90031-X_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0196-6774(89)90031-X_BIB10","series-title":"Proceedings, 23rd Annu. Symp. on Foundations of Computer Science","first-page":"312","article-title":"An efficient approximation scheme for the one-dimensional bin packing problem","author":"Karmarkar","year":"1982"},{"key":"10.1016\/0196-6774(89)90031-X_BIB11","article-title":"A New Algorithm for On-line Bin Packing","author":"Lee","year":"1983"},{"key":"10.1016\/0196-6774(89)90031-X_BIB12","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","article-title":"A simple on-line packing algorithm","volume":"32","author":"Lee","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(89)90031-X_BIB13","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\/0196-6774(89)90031-X_BIB14","series-title":"Proceedings 1984 Conf. on Information Sciences and Systems","first-page":"328","article-title":"On-line bin-packing in linear time","author":"Brown","year":"1984"},{"key":"10.1016\/0196-6774(89)90031-X_BIB15","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. Assoc. Comput. Mach."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748990031X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748990031X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:54:38Z","timestamp":1548744878000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667748990031X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["019667748990031X"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(89)90031-x","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}