{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:16Z","timestamp":1759638436147,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T00:00:00Z","timestamp":1484092800000},"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 Sched"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10951-016-0504-y","type":"journal-article","created":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T13:47:36Z","timestamp":1484142456000},"page":"601-621","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Online bin stretching with three bins"],"prefix":"10.1007","volume":"20","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,1,11]]},"reference":[{"key":"504_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. Theoretical Computer Science, 443, 1\u20139.","journal-title":"Theoretical Computer Science"},{"key":"504_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. Journal of the ACM, 44, 486\u2013504.","journal-title":"Journal of the ACM"},{"key":"504_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., & Regev, O. (1998). On-line bin-stretching. In M. Luby, J. D. P. Rolim, M. Serna (Eds.), Randomization and approximation techniques in computer science (pp. 71\u201381). Berlin: Springer. \n                        http:\/\/link.springer.com\/book\/10.1007%2F3-540-49543-6","DOI":"10.1007\/3-540-49543-6_7"},{"issue":"1","key":"504_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. Theoretical Computer Science, 268(1), 17\u201341.","journal-title":"Theoretical Computer Science"},{"key":"504_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. Journal of Algorithms, 35, 108\u2013121.","journal-title":"Journal of Algorithms"},{"key":"504_CR6","unstructured":"B\u00f6hm, M. (2016). Lower bounds for online bin stretching with several bins. In E. Bampis, O. Svensson (Eds.), Student research forum papers and posters at SOFSEM 2016, CEUR WP, vol. 1548. \n                        http:\/\/www.springer.com\/us\/book\/9783319182629"},{"key":"504_CR7","unstructured":"B\u00f6hm, M., Sgall, J., van Stee, R., & Vesel\u00fd, P. (2014). Better algorithms for online bin stretching. In Approximation and online algorithms (pp. 23\u201334). Berlin: Springer."},{"key":"504_CR8","unstructured":"B\u00f6hm, M., Sgall, J., van Stee, R., & Vesel\u00fd, P. (2016). A two-phase algorithm for bin stretching with stretching factor 1.5. ArXiv preprint \n                        arXiv:1601.08111v2\n                        \n                    ."},{"key":"504_CR9","doi-asserted-by":"crossref","unstructured":"Coffman, E., Jr., Csirik, J., Galambos, G., Martello, S., & Vigo, D. (2013). Bin packing approximation algorithms: Survey and classification. In P. M. Pardalos, D.-Z. Du, & R. L. Graham (Eds.), Handbook of combinatorial optimization (pp. 455\u2013531). New York: Springer.","DOI":"10.1007\/978-1-4419-7997-1_35"},{"key":"504_CR10","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":"504_CR11","unstructured":"Gabay, M., Brauner, N., & Kotov, V. (2013a). Computing lower bounds for semi-online optimization problems: Application to the bin stretching problem. HAL preprint hal-00921663, version 2."},{"key":"504_CR12","unstructured":"Gabay, M., Brauner, N., & Kotov, V. (2015). Improved lower bounds for the online bin stretching problem. HAL preprint hal-00921663, version 3."},{"key":"504_CR13","unstructured":"Gabay, M., Kotov, V., & Brauner, N. (2013b). Semi-online bin stretching with bunch techniques. HAL preprint hal-00869858."},{"key":"504_CR14","first-page":"263","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 263\u2013269.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"504_CR15","unstructured":"Johnson, D. (1973). Near-optimal bin packing algorithms. Massachusetts Institute of Technology, project MAC. Massachusetts Institute of Technology."},{"issue":"4","key":"504_CR16","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. Operations Research Letters, 41(4), 343\u2013346.","journal-title":"Operations Research Letters"},{"key":"504_CR17","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, M. G., & Tuza, Z. (1997). Semi on-line algorithms for the partition problem. Operations Research Letters, 21, 235\u2013242.","journal-title":"Operations Research Letters"},{"key":"504_CR18","unstructured":"Ullman, J. (1971). The performance of a memory allocation algorithm. Technical Report 100."},{"key":"504_CR19","first-page":"69","volume":"13.2","author":"AL Zobrist","year":"1970","unstructured":"Zobrist, A. L. (1970). A new hashing method with application for game playing. ICCA Journal, 13.2, 69\u201373.","journal-title":"ICCA Journal"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0504-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0504-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0504-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T09:30:35Z","timestamp":1511256635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0504-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,11]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["504"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0504-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2017,1,11]]}}}