{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T17:04:44Z","timestamp":1777827884704,"version":"3.51.4"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571060"],"award-info":[{"award-number":["11571060"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","award":["716412E"],"award-info":[{"award-number":["716412E"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","award":["716412E"],"award-info":[{"award-number":["716412E"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10878-015-9976-5","type":"journal-article","created":{"date-parts":[[2015,12,20]],"date-time":"2015-12-20T20:22:12Z","timestamp":1450642932000},"page":"530-542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Online bin packing problem with buffer and bounded size revisited"],"prefix":"10.1007","volume":"33","author":[{"given":"Minghui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"key":"9976_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2012.04.017","volume":"440\u2013441","author":"J Balogh","year":"2012","unstructured":"Balogh J, B\u00e9k\u00e9si J, Galambos G (2012) New lower bounds for certain classes of bin packing algorithms. Theor Comput Sci 440\u2013441:1\u201313","journal-title":"Theor Comput Sci"},{"key":"9976_CR2","volume-title":"Approximation algorithms of NP-hard problems","author":"EG Coffman","year":"1996","unstructured":"Coffman EG, Garey JMR, Johnson DS (1996) Approximation algorithms for bin-packing: a survey. In: Hochbaumed DS (ed) Approximation algorithms of NP-hard problems. PWS Publishing Company, Boston"},{"issue":"5","key":"9976_CR3","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1142\/S0129054114500191","volume":"25","author":"N Ding","year":"2014","unstructured":"Ding N, Lan Y, Chen X, Dsa G, Guo H, Han X (2014) Online Minimum makespan scheduling with a buffer. Int J Found Comput Sci 25(5):525\u2013536","journal-title":"Int J Found Comput Sci"},{"issue":"3","key":"9976_CR4","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 Combin Optim 26(3):416\u2013436","journal-title":"J Combin Optim"},{"issue":"3","key":"9976_CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1287\/mnsc.3.3.279","volume":"3","author":"K Eisemann","year":"1957","unstructured":"Eisemann K (1957) The trim problem. Manag Sci 3(3):279\u2013284","journal-title":"Manag Sci"},{"issue":"4","key":"9976_CR6","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"},{"issue":"2","key":"9976_CR7","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":"9976_CR8","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. Inf Process Lett 110(23):1049\u20131054","journal-title":"Inf Process Lett"},{"issue":"3","key":"9976_CR9","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 Syst Sci 8(3):272\u2013314","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"9976_CR10","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee CC, Lee DT (1985) A simple on-line bin-packing algorithm. J ACM 32(3):562\u2013572","journal-title":"J ACM"},{"issue":"3","key":"9976_CR11","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 Algorithm 10(3):305\u2013326","journal-title":"J Algorithm"},{"issue":"5","key":"9976_CR12","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":"2","key":"9976_CR13","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":"2","key":"9976_CR14","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/s10878-014-9771-8","volume":"30","author":"FF Zheng","year":"2015","unstructured":"Zheng FF, Luo L, Zhang E (2015) NF-based algorithms for online bin packing with buffer and bounded item size. J Combin Optim 30(2):360\u2013369","journal-title":"J Combin Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9976-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9976-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9976-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9976-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:28Z","timestamp":1559262208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9976-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9976"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9976-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]}}}