{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T09:19:52Z","timestamp":1769851192019,"version":"3.49.0"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1007\/bf02684336","type":"journal-article","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T00:39:49Z","timestamp":1186533589000},"page":"267-273","source":"Crossref","is-referenced-by-count":11,"title":["Parameterized on-line open-end bin packing"],"prefix":"10.1007","volume":"60","author":[{"given":"Guochuan","family":"Zhang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02684336_CR1","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"S. J. Assmann","year":"1984","unstructured":"Assmann, S. J., Johnson, D. S., Kleitman, D. J., Leung, J. Y.-T.: On a dual version of the one-dimensional bin packing problem. J Algorithms5, 502\u2013525 (1984).","journal-title":"J Algorithms"},{"key":"BF02684336_CR2","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"E. G. Coffman","year":"1996","unstructured":"Coffman, E. G., Garey, M. R., Johnson, D. S.: Approximation algorithms for bin packing: A survey. In: Approximation algorithms for NP-hard problems (Hochbaum, D., ed.), pp. 46\u201393. Boston: PWS publishing 1996."},{"key":"BF02684336_CR3","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., Johnson, D. S.: Computers and intractability: a guide to the theory of NP-completeness. San Francisco: W. H. Freeman 1979."},{"key":"BF02684336_CR4","unstructured":"Leung, J. Y.-T., Dror, M., Young, G. H.: A note on an open-end bin packing problem. Manuscript, 1996."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684336.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02684336\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T18:22:37Z","timestamp":1558203757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02684336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["BF02684336"],"URL":"https:\/\/doi.org\/10.1007\/bf02684336","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}