{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:24Z","timestamp":1759667784253,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,10,11]],"date-time":"2016-10-11T00:00:00Z","timestamp":1476144000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"LabEx PERSYVAL-Lab","award":["ANR-11-LABX-0025"],"award-info":[{"award-number":["ANR-11-LABX-0025"]}]},{"name":"ICS","award":["5379"],"award-info":[{"award-number":["5379"]}]},{"name":"Belarusian BRFFI grant","award":["project F15MLD-022"],"award-info":[{"award-number":["project F15MLD-022"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10288-016-0330-2","type":"journal-article","created":{"date-parts":[[2016,10,10]],"date-time":"2016-10-10T22:20:14Z","timestamp":1476138014000},"page":"183-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improved lower bounds for the online bin stretching problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Micha\u00ebl","family":"Gabay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2890-4509","authenticated-orcid":false,"given":"Nadia","family":"Brauner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Kotov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,11]]},"reference":[{"issue":"2","key":"330_CR1","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S Albers","year":"1999","unstructured":"Albers S (1999) Better bounds for online scheduling. SIAM J Comput 29(2):459\u2013473","journal-title":"SIAM J Comput"},{"issue":"1","key":"330_CR2","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"},{"issue":"3","key":"330_CR3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","volume":"50","author":"Y Bartal","year":"1994","unstructured":"Bartal Y, Karloff H, Rabani Y (1994) A better lower bound for on-line scheduling. Inf Process Lett 50(3):113\u2013116","journal-title":"Inf Process Lett"},{"issue":"1","key":"330_CR4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S Ben-David","year":"1994","unstructured":"Ben-David S, Borodin A, Karp R, Tardos G, Wigderson A (1994) On the power of randomization in on-line algorithms. Algorithmica 11(1):2\u201314","journal-title":"Algorithmica"},{"key":"330_CR5","unstructured":"B\u00f6hm M (2016) Lower bounds for online bin stretching with several bins. In: Student Research and Forum Papers and Posters at SOFSEM 2016, CEUR WP, vol 1548"},{"key":"330_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: Bampis E, Svensson O (eds) Approximation and online algorithms vol 8952 of lecture notes in computer science. pp 23\u201334","DOI":"10.1007\/978-3-319-18263-6_3"},{"key":"330_CR7","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"330_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029561","volume-title":"Online algorithms: the state of the art","author":"A Fiat","year":"1998","unstructured":"Fiat A, Woeginger GJ (1998) Online algorithms: the state of the art. Springer, Berlin"},{"key":"330_CR9","first-page":"1","volume":"208","author":"M Gabay","year":"2013","unstructured":"Gabay M, Kotov V, Brauner N (2013) Semi-online bin stretching with bunch techniques. Les Cahiers Leibniz 208:1\u201310","journal-title":"Les Cahiers Leibniz"},{"key":"330_CR10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.tcs.2015.07.065","volume":"602","author":"M Gabay","year":"2015","unstructured":"Gabay M, Kotov V, Brauner N (2015) Online bin stretching with bunch techniques. Theor Comput Sci 602:103\u2013113","journal-title":"Theor Comput Sci"},{"key":"330_CR11","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman and Company, New York"},{"key":"330_CR12","unstructured":"Gormley T, Reingold N, Torng E, Westbrook J (2000) Generating adversaries for request-answer games. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp 564\u2013565"},{"key":"330_CR13","unstructured":"Jussien N, Rochart G, Lorca X et\u00a0al (2008) Choco: an open source java constraint programming library. In: CPAIOR\u201908 Workshop on Open-Source Software for Integer and Contraint Programming (OSSICP\u201908). pp 1\u201310"},{"issue":"4","key":"330_CR14","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"},{"issue":"1","key":"330_CR15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Lower bounds and reduction procedures for the bin packing problem. Discrete Appl Math 28(1):59\u201370","journal-title":"Discrete Appl Math"},{"issue":"5136","key":"330_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1038\/218019a0","volume":"218","author":"D Michie","year":"1968","unstructured":"Michie D (1968) Memo functions and machine learning. Nature 218(5136):19\u201322","journal-title":"Nature"},{"issue":"1","key":"330_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J Neumann","year":"1928","unstructured":"Neumann J (1928) Zur theorie der gesellschaftsspiele. Math Annal 100(1):295\u2013320","journal-title":"Math Annal"},{"issue":"8","key":"330_CR18","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1145\/358589.358616","volume":"25","author":"J Pearl","year":"1982","unstructured":"Pearl J (1982) The solution for the branching factor of the alpha-beta pruning algorithm and its optimality. Commun ACM 25(8):559\u2013564","journal-title":"Commun ACM"},{"key":"330_CR19","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"K Pruhs","year":"2004","unstructured":"Pruhs K, Sgall J, Torng E (2004) Online scheduling. In: Leung JY (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca Raton"},{"issue":"3","key":"330_CR20","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1137\/S0097539702403438","volume":"32","author":"J Rudin","year":"2003","unstructured":"Rudin J, Chandrasekaran R (2003) Improved bounds for the online scheduling problem. SIAM J Comput 32(3):717\u2013735","journal-title":"SIAM J Comput"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-016-0330-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0330-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0330-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,25]],"date-time":"2017-05-25T08:08:55Z","timestamp":1495699735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-016-0330-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,11]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["330"],"URL":"https:\/\/doi.org\/10.1007\/s10288-016-0330-2","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2016,10,11]]}}}