{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:40:23Z","timestamp":1767141623018,"version":"build-2238731810"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,3]],"date-time":"2017-02-03T00:00:00Z","timestamp":1486080000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100007543","name":"Grantov\u00e1 Agentura, Univerzita Karlova","doi-asserted-by":"publisher","award":["548214"],"award-info":[{"award-number":["548214"]}],"id":[{"id":"10.13039\/100007543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura Cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["14-10003S"],"award-info":[{"award-number":["14-10003S"]}],"id":[{"id":"10.13039\/501100001824","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,10]]},"DOI":"10.1007\/s10878-017-0114-4","type":"journal-article","created":{"date-parts":[[2017,2,3]],"date-time":"2017-02-03T11:51:37Z","timestamp":1486122697000},"page":"810-828","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A two-phase algorithm for bin stretching with stretching factor 1.5"],"prefix":"10.1007","volume":"34","author":[{"given":"Martin","family":"B\u00f6hm","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Vesel\u00fd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,3]]},"reference":[{"key":"114_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2012.03.031","volume":"443","author":"S Albers","year":"2012","unstructured":"Albers S, Hellwig M (2012) Semi-online scheduling revisited. Theor Comput Sci 443:1\u20139","journal-title":"Theor Comput Sci"},{"key":"114_CR2","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes J, Azar Y, Fiat A, Plotkin S, Waarts O (1997) On-line load balancing with applications to machine scheduling and virtual circuit routing. J ACM 44:486\u2013504","journal-title":"J ACM"},{"key":"114_CR3","doi-asserted-by":"crossref","unstructured":"Azar Y, Regev O.(1998)On-line bin-stretching. In: Proceedings of randomization and approximation techniques in computer science (RANDOM). Springer, pp 71\u201381","DOI":"10.1007\/3-540-49543-6_7"},{"issue":"1","key":"114_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(00)00258-9","volume":"268","author":"Y Azar","year":"2001","unstructured":"Azar Y, Regev O (2001) On-line bin-stretching. Theor Comput Sci 268(1):17\u201341","journal-title":"Theor Comput Sci"},{"key":"114_CR5","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jagm.1999.1070","volume":"35","author":"P Berman","year":"2000","unstructured":"Berman P, Charikar M, Karpinski M (2000) On-line load balancing for related machines. J Algorithms 35:108\u2013121","journal-title":"J Algorithms"},{"key":"114_CR6","doi-asserted-by":"crossref","unstructured":"B\u00f6hm M, Sgall J, van Stee R, Vesel\u00fd P (2015) Better algorithms for online bin stretching. In: Proceedings of the 12th workshop on approximation and online algorithms (WAOA 2014), Lecture Notes in Computer Science 8952. Springer, pp 23\u201334","DOI":"10.1007\/978-3-319-18263-6_3"},{"key":"114_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6hm M, Sgall J, van Stee R, Vesel\u00fd P (2016) Online bin stretching with three bins. arXiv preprint arXiv:1404.5569v3","DOI":"10.1007\/s10951-016-0504-y"},{"key":"114_CR8","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of combinatorial optimization","author":"E Coffman Jr","year":"2013","unstructured":"Coffman E Jr, Csirik J, Galambos G, Martello S, Vigo D (2013) Bin packing approximation algorithms: survey and classification. In: Pardalos PM, Du DZ, Graham RL (eds) Handbook of combinatorial optimization. Springer, New York, pp 455\u2013531"},{"key":"114_CR9","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1007\/s00453-008-9235-6","volume":"53","author":"T Ebenlendr","year":"2009","unstructured":"Ebenlendr T, Jawor W, Sgall J (2009) Preemptive online scheduling: optimal algorithms for all speeds. Algorithmica 53:504\u2013522","journal-title":"Algorithmica"},{"key":"114_CR10","unstructured":"Gabay M, Brauner N, Kotov V (2013) Computing lower bounds for semi-online optimization problems: application to the bin stretching problem. HAL preprint hal-00921663, version 2"},{"key":"114_CR11","unstructured":"Gabay M, Brauner N, Kotov V (2015) Improved lower bounds for the online bin stretching problem. HAL preprint hal-00921663, version 3"},{"key":"114_CR12","unstructured":"Gabay M, Kotov V, Brauner N (2013) Semi-online bin stretching with bunch techniques. HAL preprint hal-00869858"},{"key":"114_CR13","first-page":"263","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:263\u2013269","journal-title":"SIAM J Appl Math"},{"key":"114_CR14","unstructured":"Johnson D (1973) Near-optimal bin packing algorithms. Massachusetts Institute of Technology Technical Report MAC TR-109, Project MAC, Cambridge, Massachusetts"},{"issue":"4","key":"114_CR15","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.orl.2013.03.005","volume":"41","author":"H Kellerer","year":"2013","unstructured":"Kellerer H, Kotov V (2013) An efficient algorithm for bin stretching. Oper Res Lett 41(4):343\u2013346","journal-title":"Oper Res Lett"},{"key":"114_CR16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H Kellerer","year":"1997","unstructured":"Kellerer H, Kotov V, Speranza MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21:235\u2013242","journal-title":"Oper Res Lett"},{"key":"114_CR17","first-page":"15-1","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis, chapter\u00a015","author":"K Pruhs","year":"2004","unstructured":"Pruhs K, Sgall J, Torng E (2004) Online scheduling. In: Leung JY-T (ed) Handbook of scheduling: algorithms, models, and performance analysis, chapter\u00a015. CRC Press, Boca Raton, pp 15-1\u201315-41"},{"key":"114_CR18","unstructured":"Ullman J (1971) The performance of a memory allocation algorithm. Technical Report 100"}],"updated-by":[{"DOI":"10.1007\/s10878-017-0116-2","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2017,2,24]],"date-time":"2017-02-24T00:00:00Z","timestamp":1487894400000}}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0114-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0114-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0114-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T08:16:10Z","timestamp":1658564170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0114-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,3]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["114"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0114-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,3]]}}}