{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:25:14Z","timestamp":1743121514929,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_3","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T01:13:18Z","timestamp":1384996398000},"page":"25-36","source":"Crossref","is-referenced-by-count":0,"title":["NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation"],"prefix":"10.1007","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Ullman, J.D.: The performance of a memory allocation algorithm. Tech. Rep. 100, Princeton University, Princeton (1971)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01415672","volume":"42","author":"G. Galambos","year":"1995","unstructured":"Galambos, G., Woeginger, G.J.: On-line Bin Packing-A Restricted Survey. Mathematical Methods of Operations Research\u00a042, 25\u201345 (1995)","journal-title":"Mathematical Methods of Operations Research"},{"issue":"5","key":"3_CR3","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S.S. Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. Journal of the ACM\u00a049(5), 640\u2013671 (2002)","journal-title":"Journal of the ACM"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Fast algorithms for bin packing. Journal of Computer and System Sciences\u00a08, 272\u2013314 (1974)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics\u00a041(4), 579\u2013585 (1994)","journal-title":"Naval Research Logistics"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0167-6377(99)00077-2","volume":"26","author":"G.C. Zhang","year":"2000","unstructured":"Zhang, G.C., Cai, X.Q., Wong, C.K.: Linear time-approximation algorithms for bin packing. Operations Research Letters\u00a026, 217\u2013222 (2000)","journal-title":"Operations Research Letters"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., et al.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing\u00a03, 256\u2013278 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"A.C.C. Yao","year":"1980","unstructured":"Yao, A.C.C.: New algorithms for bin packing. Journal of the ACM\u00a027, 207\u2013227 (1980)","journal-title":"Journal of the ACM"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","volume":"10","author":"P. Ramanan","year":"1989","unstructured":"Ramanan, P., Brown, D.J., Lee, C.C., Lee, D.T.: On-line bin packing in linear time. J. Algorithms\u00a010, 305\u2013326 (1989)","journal-title":"J. Algorithms"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-18318-8_3","volume-title":"Approximation and Online Algorithms","author":"J. Balogh","year":"2011","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Galambos, G.: New Lower Bounds for Certain Classes of Bin Packing Algorithms. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol.\u00a06534, pp. 25\u201336. Springer, Heidelberg (2011)"},{"key":"3_CR11","unstructured":"Galambos, G.: A new heuristic for the classical bin packing problem. Tech. Rept 82, Institut f\u00fcr Mathematik, Universit\u00e4t Augsburg (1985)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02248693","volume":"49","author":"G. Galambos","year":"1993","unstructured":"Galambos, G., Woeginger, G.J.: Repacking helps in bounded space on-line bin packing. Computing\u00a049, 329\u2013338 (1993)","journal-title":"Computing"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1137\/S0097539799180408","volume":"30","author":"G. Gambosi","year":"2000","unstructured":"Gambosi, G., Postiglione, A., Talamo, M.: Algorithms for the relaxed online bin-packing model. SIAM Journal on Computing\u00a030, 1532\u20131551 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR14","first-page":"117","volume":"24","author":"J. Balogh","year":"2007","unstructured":"Balogh, J., Galambos, G.: Algorithms for the on-line bin packing problem with repacking. Alkalmazott Matematikai Lapok\u00a024, 117\u2013130 (2007)","journal-title":"Alkalmazott Matematikai Lapok"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Galambos, G., et al.: On-line bin packing with restricted repacking. Journal of Combinatorial Optimization (published online, 2013)","DOI":"10.1007\/s10878-012-9489-4"},{"issue":"2","key":"3_CR16","first-page":"72","volume":"1","author":"G. Gutin","year":"2006","unstructured":"Gutin, G., Jensen, T., Yeo, A.: Optimal on-line bin packing with two item sizes. Algorithmic Operations Research\u00a01(2), 72\u201378 (2006)","journal-title":"Algorithmic Operations Research"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.disopt.2008.04.003","volume":"5","author":"L. Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: More on online bin packing with two item sizes. Discrete Optimization\u00a05, 705\u2013713 (2008)","journal-title":"Discrete Optimization"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/0212014","volume":"12","author":"E.G. Coffman","year":"1983","unstructured":"Coffman, E.G., J\u00e1nos, J., R\u00f3nyai, C.L., et al.: Dynamic bin packing. SIAM Journal of Computing\u00a012(2), 227\u2013258 (1983)","journal-title":"SIAM Journal of Computing"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1016\/j.ipl.2010.09.002","volume":"110","author":"X. Han","year":"2010","unstructured":"Han, X., Peng, C., Ye, D., et al.: Dynamic bin packing with unit fraction items revisited. Information Processing Letters\u00a0110, 1049\u20131054 (2010)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T09:00:09Z","timestamp":1558688409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}