{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T17:04:47Z","timestamp":1777827887233,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10878-014-9771-8","type":"journal-article","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T03:48:26Z","timestamp":1405309706000},"page":"360-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["NF-based algorithms for online bin packing with buffer and bounded item size"],"prefix":"10.1007","volume":"30","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","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"9771_CR1","doi-asserted-by":"crossref","unstructured":"Balogh J, B\u00e9k\u00e9si J, Galambos G (2011) New lower bounds for certain classes of bin packing algorithms. In proceedings of the 8th Workshop on Approximation and Online Algorithms, LNCS 6534, pp 25\u201336, Liverpool.","DOI":"10.1007\/978-3-642-18318-8_3"},{"issue":"1","key":"9771_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10878-012-9489-4","volume":"27","author":"J Balogh","year":"2014","unstructured":"Balogh J, B\u00e9k\u00e9si J, Galambos G, Reinelt G (2014) On-line bin packing with restricted repacking. J Comb Optim 27(1):115\u2013131","journal-title":"J Comb Optim"},{"key":"9771_CR3","first-page":"117","volume":"24","author":"J Balogh","year":"2007","unstructured":"Balogh J, Galambos G (2007) Algorithms for the on-line bin packing problem with repacking. Alkalmazott Matematikai Lapok 24:117\u2013130","journal-title":"Alkalmazott Matematikai Lapok"},{"issue":"2","key":"9771_CR4","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0212014","volume":"12","author":"EG Coffman","year":"1983","unstructured":"Coffman EG, J\u00e1nos J, R\u00f3nyai CL, Zsb\u00e1n A (1983) Dynamic bin packing. SIAM J Comput 12(2):227\u2013258","journal-title":"SIAM J Comput"},{"key":"9771_CR5","unstructured":"Coffman EG, Garey JMR, Johnson DS (1996) Approximation algorithms for bin-packing: a survey. In Hochbaum D (ed), Approximation algorithms of NP-hard problems. PWS Publishing Company, Boston."},{"issue":"3","key":"9771_CR6","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/s10878-011-9408-0","volume":"26","author":"G Dosa","year":"2013","unstructured":"Dosa G, Tuza Z, Ye DS (2013) Bin packing with \u201clargest in bottom\u201d constraint: tighter bounds and generalizations. J Comb Optim 26(3):416\u2013436","journal-title":"J Comb Optim"},{"issue":"4","key":"9771_CR7","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/j.disopt.2008.04.003","volume":"5","author":"L Epstein","year":"2008","unstructured":"Epstein L, Levin A (2008) More on online bin packing with two item sizes. Discret Optim 5(4):705\u2013713","journal-title":"Discret Optim"},{"key":"9771_CR8","unstructured":"Galambos G (1985) A new heuristic for the classical bin packing problem. Tech Report 82, Institut f\u00fcr Mathematik, Universit\u00e4t Augsburg."},{"issue":"5","key":"9771_CR9","doi-asserted-by":"crossref","first-page":"1532","DOI":"10.1137\/S0097539799180408","volume":"30","author":"G Gambosi","year":"2000","unstructured":"Gambosi G, Postiglione A, Talamo M (2000) Algorithms for the relaxed online bin-packing model. SIAM J Comput 30(5):1532\u20131551","journal-title":"SIAM J Comput"},{"issue":"4","key":"9771_CR10","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02248693","volume":"49","author":"G Galambos","year":"1993","unstructured":"Galambos G, Woeginger GJ (1993) Repacking helps in bounded space on-line bin packing. Computing 49(4):329\u2013338","journal-title":"Computing"},{"issue":"1","key":"9771_CR11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01415672","volume":"42","author":"G Galambos","year":"1995","unstructured":"Galambos G, Woeginger GJ (1995) On-line Bin Packing-A Restricted Survey. Math Methods Oper Res 42(1):25\u201345","journal-title":"Math Methods Oper Res"},{"issue":"2","key":"9771_CR12","first-page":"72","volume":"1","author":"G Gutin","year":"2006","unstructured":"Gutin G, Jensen T, Yeo A (2006) Optimal on-line bin packing with two item sizes. Algorithm Oper Res 1(2):72\u201378","journal-title":"Algorithm Oper Res"},{"issue":"23","key":"9771_CR13","doi-asserted-by":"crossref","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, Zhang DH, Lan Y (2010) Dynamic bin packing with unit fraction items revisited. Info Process Lett 110(23):1049\u20131054","journal-title":"Info Process Lett"},{"issue":"3","key":"9771_CR14","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"DS Johnson","year":"1974","unstructured":"Johnson DS (1974) Fast algorithms for bin packing. J Comput Sys Sci 8(3):272\u2013314","journal-title":"J Comput Sys Sci"},{"issue":"4","key":"9771_CR15","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3(4):256\u2013278","journal-title":"SIAM J Comput"},{"issue":"3","key":"9771_CR16","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0196-6774(89)90031-X","volume":"10","author":"P Ramanan","year":"1989","unstructured":"Ramanan P, Brown DJ, Lee CC, Lee DT (1989) On-line bin packing in linear time. J Algorithms 10(3):305\u2013326","journal-title":"J Algorithms"},{"issue":"5","key":"9771_CR17","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"SS Seiden","year":"2002","unstructured":"Seiden SS (2002) On the online bin packing problem. J ACM 49(5):640\u2013671","journal-title":"J ACM"},{"issue":"4","key":"9771_CR18","doi-asserted-by":"crossref","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 (1994) New worst-case results for the bin-packing problem. Naval Res Logist 41(4):579\u2013585","journal-title":"Naval Res Logist"},{"key":"9771_CR19","unstructured":"Ullman JD (1971) The performance of a memory allocation algorithm. Tech Report 100. Princeton University, Princeton."},{"issue":"2","key":"9771_CR20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"ACC Yao","year":"1980","unstructured":"Yao ACC (1980) New algorithms for bin packing. J ACM 27(2):207\u2013227","journal-title":"J ACM"},{"issue":"5","key":"9771_CR21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0167-6377(99)00077-2","volume":"26","author":"GC Zhang","year":"2000","unstructured":"Zhang GC, Cai XQ, Wong CK (2000) Linear time-approximation algorithms for bin packing. Oper Res Lett 26(5):217\u2013222","journal-title":"Oper Res Lett"},{"issue":"2","key":"9771_CR22","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10878-012-9457-z","volume":"26","author":"Y Zhang","year":"2013","unstructured":"Zhang Y, Chin FYL, Ting HF, Han X (2013) Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing. J Comb Optim 26(2):223\u2013236","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9771-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9771-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9771-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:24Z","timestamp":1559276604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9771-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9771"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9771-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,15]]}}}