{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:40:40Z","timestamp":1759848040356},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"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":[[1996,6]]},"DOI":"10.1007\/bf02309343","type":"journal-article","created":{"date-parts":[[2006,2,14]],"date-time":"2006-02-14T22:47:26Z","timestamp":1139957246000},"page":"165-172","source":"Crossref","is-referenced-by-count":12,"title":["Worst-Case analysis of the FFH algorithm for online variable-sized bin packing"],"prefix":"10.1007","volume":"56","author":[{"given":"G.","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02309343_CR1","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D. K. Friesen","year":"1986","unstructured":"Friesen, D. K., Langston, M. A.: Variable sized bin packing. SIAM J. Comput.15, 222\u2013229 (1986).","journal-title":"SIAM J. Comput."},{"key":"BF02309343_CR2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"M. R. Garey","year":"1976","unstructured":"Garey, M. R., Graham, R. L., Johnson, D. S.: Resource constrained scheduling as generalized bin packing. J. Comb. Theory21, 257\u2013298 (1976).","journal-title":"J. Comb. Theory"},{"key":"BF02309343_CR3","unstructured":"Johnson, D. S.: Near-optimal bin packing algorithms. Doctoral Thesis MIT, Cambridge, MA (1973)."},{"key":"BF02309343_CR4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D. S. Johnson","year":"1974","unstructured":"Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., Graham, R. L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput.3, 299\u2013325 (1974).","journal-title":"SIAM J. Comput."},{"key":"BF02309343_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0166-218X(88)90089-3","volume":"22","author":"N. G. Kinnersley","year":"1988\/89","unstructured":"Kinnersley, N. G., Langston, M. A.: Online variable-sized binpacking. Discrete Appl. Math.22, 143\u2013148 (1988\/89).","journal-title":"Discrete Appl. Math."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02309343.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02309343\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02309343","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:10:09Z","timestamp":1558012209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02309343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF02309343"],"URL":"https:\/\/doi.org\/10.1007\/bf02309343","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}