{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:32:33Z","timestamp":1771979553620,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0020-0190(97)00216-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"229-233","source":"Crossref","is-referenced-by-count":36,"title":["A approximation algorithm for bin packing with extendable bins"],"prefix":"10.1016","volume":"65","author":[{"given":"Paolo","family":"Dell'Olmo","sequence":"first","affiliation":[]},{"given":"Hans","family":"Kellerer","sequence":"additional","affiliation":[]},{"given":"Maria Grazia","family":"Speranza","sequence":"additional","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00216-0_BIB1","series-title":"Algorithm Design for Computer System Design","first-page":"49","article-title":"Approximation algorithms for bin packing \u2014 An update survey","author":"Coffman","year":"1984"},{"key":"10.1016\/S0020-0190(97)00216-0_BIB2","series-title":"Computers and Intractability: A guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(97)00216-0_BIB3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0020-0190(97)00216-0_BIB4","unstructured":"M.G. Speranza, Zs. Tuza, On-line approximation algorithms for scheduling tasks on identical machines with extendable working time, Ann. of Oper. Res. (to appear)."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002160?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002160?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T10:55:02Z","timestamp":1556362502000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0020019097002160"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00216-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}