{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:10:03Z","timestamp":1648890603349},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T00:00:00Z","timestamp":1400198400000},"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-9749-6","type":"journal-article","created":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T13:22:02Z","timestamp":1400160122000},"page":"276-298","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online bin packing with (1,1) and (2, $$R$$ R ) bins"],"prefix":"10.1007","volume":"30","author":[{"given":"Jing","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Iwama","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":[[2014,5,16]]},"reference":[{"key":"9749_CR1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/s10100-012-0266-3","volume":"21","author":"J Balogh","year":"2013","unstructured":"Balogh J, B\u00e9k\u00e9si J (2013) Semi-on-line bin packing: a short overview and a new lower bound. Cent Eur J Oper Res 21:685\u2013698","journal-title":"Cent Eur J Oper Res"},{"key":"9749_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) Online bin packing with restricted repacking. J Comb Optim 27:115\u2013131","journal-title":"J Comb Optim"},{"key":"9749_CR3","unstructured":"Brown DJ (1979) A lower bound for on-line one-dimensional bin packing algorithms. Tech report -864. Coordinated Science Laboratory, Urbana, IL"},{"key":"9749_CR4","volume-title":"Approximation algorithms","author":"EG Coffman","year":"1997","unstructured":"Coffman EG, Garey MR, Johnson DS (1997) Approximation algorithms for bin packing: a survey. In: Hochbaum D (ed) Approximation algorithms. PWS Publishing Company, Boston, MA"},{"issue":"8","key":"9749_CR5","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/BF00289157","volume":"26","author":"J Csirik","year":"1989","unstructured":"Csirik J (1989) An on-line algorithm for variable-sized bin packing. Acta Inf 26(8):697\u2013709","journal-title":"Acta Inf"},{"issue":"1","key":"9749_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/060670328","volume":"38","author":"L Epstein","year":"2008","unstructured":"Epstein L, Levin A (2008) An APTAS for generalized cost variable-sized bin packing. SIAM J Comput 38(1):411\u2013428","journal-title":"SIAM J Comput"},{"key":"9749_CR7","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"DK Friesten","year":"1986","unstructured":"Friesten DK, Langston MA (1986) Variable sized bin packing. SIAM J Comput 15:222\u2013230","journal-title":"SIAM J Comput"},{"key":"9749_CR8","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 algorithm for bin packing. J Comput Syst Sci 8:272\u2013314","journal-title":"J Comput Syst Sci"},{"key":"9749_CR9","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:256\u2013278","journal-title":"SIAM J Comput"},{"issue":"2","key":"9749_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0166-218X(88)90089-3","volume":"22","author":"NG Kinnerseley","year":"1988","unstructured":"Kinnerseley NG, Langston MA (1988) Online variable-sized bin packing. Discret Appl Math 22(2):143\u2013148","journal-title":"Discret Appl Math"},{"issue":"3","key":"9749_CR11","first-page":"256","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee CC, Lee DT (1985) A simple on-line bin packing algorithm. JACM 32(3):256\u2013278","journal-title":"JACM"},{"key":"9749_CR12","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0020-0190(80)90077-0","volume":"10","author":"FM Liang","year":"1980","unstructured":"Liang FM (1980) A lower bound for on-line bin packing. Inf Process Lett 10:76\u201379","journal-title":"Inf Process Lett"},{"key":"9749_CR13","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. JACM 49:640\u2013671","journal-title":"JACM"},{"issue":"2","key":"9749_CR14","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/S0097539702412908","volume":"32","author":"SS Seiden","year":"2002","unstructured":"Seiden SS, Van Stee R, Epstein L (2002) New bounds for variable-sized online bin packing. SIAM J Comput 32(2):455\u2013469","journal-title":"SIAM J Comput"},{"key":"9749_CR15","unstructured":"Ullman JD (1971) The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ"},{"key":"9749_CR16","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(92)90223-I","volume":"43","author":"A Vliet Van","year":"1992","unstructured":"Van Vliet A (1992) An improved lower bound for online bin packing algorithm. Inf Process Lett 43:277\u2013284","journal-title":"Inf Process Lett"},{"key":"9749_CR17","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. JACM 27:207\u2013227","journal-title":"JACM"},{"issue":"2","key":"9749_CR18","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 H, 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-9749-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9749-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9749-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:23Z","timestamp":1559276603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9749-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,16]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9749"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9749-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,16]]}}}