{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:40:02Z","timestamp":1751283602540,"version":"3.41.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1023\/a:1019577921700","type":"journal-article","created":{"date-parts":[[2003,3,13]],"date-time":"2003-03-13T23:25:54Z","timestamp":1047597954000},"page":"455-471","source":"Crossref","is-referenced-by-count":5,"title":["Performance Analysis and Improvement for Some Linear On-Line Bin-Packing Algorithms"],"prefix":"10.1007","volume":"6","author":[{"given":"Xiaodong","family":"Gu","sequence":"first","affiliation":[]},{"given":"Guoliang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Liusheng","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Yunjae","family":"Jung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5092721_CR1","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"E.G. Coffman","year":"1996","unstructured":"E.G. Coffman, M.R. Garey, and D.S. Johnson, \u201cApproximation algorithms for bin Packing: A survey,\u201d in Approximation Algorithms for NP-Hard Problems, D. Hochbaum (Ed.), PWS Publishing: Boston, 1996, pp. 46\u201393."},{"key":"5092721_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<69::AID-RSA4>3.0.CO;2-V","volume":"10","author":"E.G. Coffman Jr.","year":"1996","unstructured":"E.G. Coffman, Jr., D.S. Johnson, P.W. Shor, and R.R. Weber, \u201cBin packing with discrete item sizes, Part II: Tight bounds on first fit,\u201d Random Structures and Algorithms, vol. 10, pp. 69\u2013101, 1996.","journal-title":"Random Structures and Algorithms"},{"key":"5092721_CR3","first-page":"105","volume":"44","author":"E.G. Coffman Jr.","year":"1980","unstructured":"E.G. Coffman, Jr., K. So, M. Hofri, and A.C. Yao, \u201cA stochastic model of bin packing,\u201d Int. and Cont., vol. 44, pp. 105\u2013115, 1980.","journal-title":"Int. and Cont."},{"key":"5092721_CR4","first-page":"309","volume-title":"Proceedings, 2nd Annual ACM-SIAM Symposium on Discrete, Algorithms","author":"Csirik","year":"1991","unstructured":"Csirik and D.S. Johnson, \u201cBounded space on-line bin packing: Best is better than first,\u201d in Proceedings, 2nd Annual ACM-SIAM Symposium on Discrete, Algorithms. Society for Industrial and Applied Mathematics: Philadelphia, PA, 1991, pp. 309\u2013319."},{"key":"5092721_CR5","doi-asserted-by":"crossref","unstructured":"Csirik, D.S. Johnson C. Kenyon, J.B. Orlin, P.W. Shor, and R.R. Weber, \u201cOn the sum-of-square algorithm for bin packing,\u201d in Proc. 2000 ACM Symp. on Theory of Computing, 2000, pp. 208\u2013217.","DOI":"10.1145\/335305.335331"},{"key":"5092721_CR6","volume-title":"Computers and Intractability: A Guild to the Theory of NP-Completeness","author":"M.R. Garey","year":"1978","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guild to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1978."},{"key":"5092721_CR7","volume-title":"Near-optimal bin packing algorithms","author":"D.S. Johnson","year":"1973","unstructured":"D.S. Johnson, \u201cNear-optimal bin packing algorithms,\u201d Ph.D. Thesis, Massachusetts Institute of Technology, Department of Mathematics, Cambridge, 1973."},{"key":"5092721_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham, \u201cWorst-case performance bounds for simple one-dimensional packing algorithms,\u201d SIAM J. Comput., vol. 3, pp. 299\u2013325, 1974.","journal-title":"SIAM J. Comput."},{"key":"5092721_CR9","doi-asserted-by":"crossref","unstructured":"N. Karmarkar, \u201cProbabilistic analysis of some bin-packing algorithms,\u201d in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 107\u2013111.","DOI":"10.1109\/SFCS.1982.37"},{"key":"5092721_CR10","first-page":"312","volume-title":"Proc. 23rd Ann. Symp. on Foundations of Computer Science","author":"N. Karmarkar","year":"1982","unstructured":"N. Karmarkar and R.M. Karp, \u201cAn efficient approximation scheme for the one-dimensional bin packing problem,\u201d in Proc. 23rd Ann. Symp. on Foundations of Computer Science, IEEE Computer Soc., Silver Spring, MD, 1982, pp. 312\u2013320."},{"issue":"3","key":"5092721_CR11","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C.C. Lee","year":"1985","unstructured":"C.C. Lee and D.T. Lee, \u201cA simple on-line bin-packing algorithm,\u201d Journal of the ACM, vol. 32, no. 3, pp. 562\u2013572, 1985.","journal-title":"Journal of the ACM"},{"key":"5092721_CR12","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1145\/44483.44487","volume":"35","author":"W.T. Rhee","year":"1988","unstructured":"W.T. Rhee and M. Talagrand, \u201cSome distributions that allow perfect packing,\u201d Assoc. Comp. Mach., vol. 35, pp. 564\u2013578, 1988.","journal-title":"Assoc. Comp. Mach."},{"key":"5092721_CR13","volume-title":"Lower and upper bounds for on-line bin packing and scheduling heuristic","author":"A. van Vliet","year":"1995","unstructured":"A. van Vliet, \u201cLower and upper bounds for on-line bin packing and scheduling heuristic,\u201d Ph.D. Thesis, Erasmus University, Rotterdam, Netherlands, 1995."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019577921700.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019577921700\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019577921700.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:08:51Z","timestamp":1751281731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019577921700"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["5092721"],"URL":"https:\/\/doi.org\/10.1023\/a:1019577921700","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}