{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T07:46:29Z","timestamp":1722411989812},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1007\/bf02962214","type":"journal-article","created":{"date-parts":[[2008,9,27]],"date-time":"2008-09-27T19:59:04Z","timestamp":1222545544000},"page":"213-218","source":"Crossref","is-referenced-by-count":2,"title":["Deep performance analysis of Refined Harmonic bin packing algorithm"],"prefix":"10.1007","volume":"17","author":[{"given":"Xiaodong","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinlong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02962214_CR1","first-page":"46","volume-title":"Approximation Algorithms for Bin Packing: A survey. Approximation Algorithms for NP-Hard Problems","author":"E G Conffman","year":"1996","unstructured":"Conffman E G, Garey M R, Johnson D S. Approximation Algorithms for Bin Packing: A survey. Approximation Algorithms for NP-Hard Problems, Hochbaum D (ed.), PWS Publishing, Boston, 1996, pp.46\u201393."},{"key":"BF02962214_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M R Garey","year":"1978","unstructured":"Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, NY, 1978."},{"key":"BF02962214_CR3","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., 1974, 3: 299\u2013325.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"BF02962214_CR4","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C C Lee","year":"1985","unstructured":"Lee C C, Lee D T. A simple on-line bin-packing algorithm.Journal of the ACM, 1985, 32(3): 562\u2013572.","journal-title":"Journal of the ACM"},{"key":"BF02962214_CR5","unstructured":"Csirik J, Johnson D S, Kenyon C, Orlin J B, Shor P W, Weber R R. On the sum-of-square algorithm for bin packing. InProc. 2000 ACM Symp. on Theory of Computing, 2000."},{"key":"BF02962214_CR6","unstructured":"Csirik J, Johnson D S. Bounded space on-line bin packing: Best is better than first. InProceedings 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, 1991, pp.309\u2013319. Society for Industrial and Applied Mathematics."},{"key":"BF02962214_CR7","volume-title":"Lower and upper bounds for on-line bin packing and scheduling heuristic","author":"A Vliet van","year":"1995","unstructured":"A van Vliet. Lower and upper bounds for on-line bin packing and scheduling heuristic [dissertation]. Erasmus University, Rotterdam, Netherlands, 1995."},{"key":"BF02962214_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0019-9958(80)90050-9","volume":"44","author":"E G Coffman","year":"1980","unstructured":"Coffman E G, So K, Hofri M, Yao A C. A stochastic model of bin-packing.Inf. and Cont., 1980, 44: 105\u2013115.","journal-title":"Inf. and Cont."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02962214.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02962214\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02962214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T23:16:59Z","timestamp":1558567019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02962214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["BF02962214"],"URL":"https:\/\/doi.org\/10.1007\/bf02962214","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}