{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:27:08Z","timestamp":1760383628118},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00410-8","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T19:19:50Z","timestamp":1034968790000},"page":"939-952","source":"Crossref","is-referenced-by-count":21,"title":["Two-dimensional on-line bin packing problem with rotatable items"],"prefix":"10.1016","volume":"289","author":[{"given":"Satoshi","family":"Fujita","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Hada","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00410-8_BIB1","doi-asserted-by":"crossref","unstructured":"D. Blitz, A. van Vliet, G.J. Woeginger, Lower bounds on the asymptotic worst-case ratio of on-line bin packing algorithms, 1996, unpublished manuscript.","DOI":"10.1006\/jagm.1996.0005"},{"key":"10.1016\/S0304-3975(01)00410-8_BIB2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0167-6377(89)90027-8","article-title":"Multidimensional on-line bin packing","volume":"8","author":"Coppersmith","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0304-3975(01)00410-8_BIB3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(93)90004-Z","article-title":"An on-line algorithm for multidimensional bin packing","volume":"13","author":"Csirik","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0304-3975(01)00410-8_BIB4","series-title":"Computers and Intractability: A Guide for the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(01)00410-8_BIB5","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(01)00410-8_BIB6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0166-218X(91)90087-D","article-title":"Improved bounds for harmonic-based bin packing algorithms","volume":"34","author":"Richey","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00410-8_BIB7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","article-title":"An improved lower bound for on-line bin packing algorithms","volume":"43","author":"van Vliet","year":"1992","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004108?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004108?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:23:27Z","timestamp":1578536607000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501004108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501004108"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00410-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}