{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:41:57Z","timestamp":1740145317960,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Research, Development and Innovation Office \u2013 NKFIH","award":["SNN 116095"],"award-info":[{"award-number":["SNN 116095"]}]},{"name":"VKSZ","award":["12- 24 1-2013-0088"],"award-info":[{"award-number":["12- 24 1-2013-0088"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271324","11471286"],"award-info":[{"award-number":["11271324","11471286"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10100-017-0481-z","type":"journal-article","created":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T07:33:56Z","timestamp":1497425636000},"page":"161-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tight upper bounds for semi-online scheduling on two uniform machines with known optimum"],"prefix":"10.1007","volume":"26","author":[{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3637-4066","authenticated-orcid":false,"given":"Armin","family":"F\u00fcgenschuh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyi","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"W\u0119sek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"481_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:459\u2013473","journal-title":"SIAM J Comput"},{"key":"481_CR2","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/B:JOSH.0000046074.03560.5d","volume":"7","author":"E Angelelli","year":"2004","unstructured":"Angelelli E, Nagy \u00c1B, Speranza MG, Tuza Z (2004) The on-line multiprocessor scheduling problem with known sum of the tasks. J Sched 7:421\u2013428","journal-title":"J Sched"},{"key":"481_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10951-007-0023-y","volume":"10","author":"E Angelelli","year":"2007","unstructured":"Angelelli E, Speranza MG, Tuza Z (2007) Semi on-line scheduling on three processors with known sum of the tasks. J Sched 10:263\u2013269","journal-title":"J Sched"},{"key":"481_CR4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.tcs.2007.12.005","volume":"393","author":"E Angelelli","year":"2008","unstructured":"Angelelli E, Speranza MG, Tuza Z (2008) Semi-online scheduling on two uniform processors. Theor Comput Sci 393:211\u2013219","journal-title":"Theor Comput Sci"},{"key":"481_CR5","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1080\/10556780903239311","volume":"25","author":"E Angelelli","year":"2010","unstructured":"Angelelli E, Speranza MG, Szoldatics J, Tuza Z (2010) Geometric representation for semi on-line scheduling on uniform processors. Optim Methods Softw 25:421\u2013428","journal-title":"Optim Methods Softw"},{"issue":"1","key":"481_CR6","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":"481_CR7","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":"481_CR8","doi-asserted-by":"crossref","unstructured":"B\u00f6hm M, Sgall J, van Stee R, Vesel\u00fd P (2016a) A two-phase algorithm for bin stretching with stretching factor 1.5. Technical report, CoRR abs\/1601.08111, v2","DOI":"10.1007\/s10878-017-0114-4"},{"key":"481_CR9","unstructured":"B\u00f6hm M, Sgall J, van Stee R, Vesel\u00fd P (2016b) Online bin stretching with three bins. Technical report abs\/1404.5569, v2, CoRR"},{"key":"481_CR10","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.tcs.2004.11.018","volume":"337","author":"TCE Cheng","year":"2005","unstructured":"Cheng TCE, Kellerer H, Kotov V (2005) Semi-on-line multi-processor scheduling with given total processing time. Theor Comput Sci 337:134\u2013146","journal-title":"Theor Comput Sci"},{"key":"481_CR11","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/s10878-009-9265-2","volume":"21","author":"G D\u00f3sa","year":"2011","unstructured":"D\u00f3sa G, Speranza MG, Tuza Z (2011) Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling. J Comb Optim 21:458\u2013480","journal-title":"J Comb Optim"},{"key":"481_CR12","doi-asserted-by":"crossref","unstructured":"D\u00f3sa G, F\u00fcgenschuh A, Tan Z, Tuza Z, W\u0119sek K (2015a) Semi-online scheduling on two uniform machines with known optimum part I: tight lower bounds. Technical report, Applied mathematics and optimization series AMOS#27, Helmut Schmidt University\/University of the Federal Armed Forces, Hamburg, Germany","DOI":"10.1007\/s10100-018-0536-9"},{"key":"481_CR13","unstructured":"D\u00f3sa G, F\u00fcgenschuh A, Tan Z, Tuza Z, W\u0119sek K (2015b) Semi-online scheduling on two uniform machines with known optimum part II: tight upper bounds. Technical report, Applied mathematics and optimization series AMOS#28, Helmut Schmidt University\/University of the Federal Armed Forces, Hamburg, Germany"},{"key":"481_CR14","unstructured":"Ebenlendr T, Sgall J (2007) A lower bound on deterministic online algorithms for scheduling on related machines without preemption. In: Proceeding of the 9th workshop on approximation and online algorithms. Lecture notes in computer science, pp 102\u2013108"},{"key":"481_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00236-002-0102-7","volume":"39","author":"L Epstein","year":"2003","unstructured":"Epstein L (2003) Bin stretching revisited. Acta Inform 39:97\u2013117","journal-title":"Acta Inform"},{"key":"481_CR16","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle U, Kern W, Tur\u00e1n G (1989) On the performance of on-line algorithm for particular problem. Acta Cybern 9:107\u2013119","journal-title":"Acta Cybern"},{"issue":"6","key":"481_CR17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R Fleischer","year":"2000","unstructured":"Fleischer R, Wahl M (2000) On-line scheduling revisited. J Sched 3(6):343\u2013353","journal-title":"J Sched"},{"key":"481_CR18","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":"481_CR19","unstructured":"Gormley T, Reingold N, Torng E, Westbrook J (2000) Generating adversaries for request-answer games. In: Proceeding of the 11th ACM-SIAM symposium on discrete algorithms. ACM, New York\/Society for Industrial and Applied Mathematics, Philadelphia, pp 564\u2013565"},{"issue":"2","key":"481_CR20","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds for certain multiprocessing anomalies. SIAM J Appl Math 17(2):416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"481_CR21","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":"481_CR22","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10951-013-0329-x","volume":"16","author":"K Lee","year":"2013","unstructured":"Lee K, Lim K (2013) Semi-online scheduling problems on a small number of machines. J Sched 16:461\u2013477","journal-title":"J Sched"},{"issue":"8\u201310","key":"481_CR23","first-page":"776","volume":"410","author":"CT Ng","year":"2009","unstructured":"Ng CT, Tan Z, He Y, Cheng TCE (2009) Two semi-online scheduling problems on two uniform machines. Theor Comput Sci 410(8\u201310):776\u2013792","journal-title":"Theor Comput Sci"},{"key":"481_CR24","doi-asserted-by":"crossref","first-page":"2191","DOI":"10.1007\/978-1-4419-7997-1_2","volume-title":"Handbook of combinatorial optimization","author":"Z Tan","year":"2013","unstructured":"Tan Z, Zhang A (2013) Online and semi-online scheduling. In: Pardalos PM et al (eds) Handbook of combinatorial optimization. Springer Science+Business Media, New York, pp 2191\u20132252"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-017-0481-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0481-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0481-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T22:22:02Z","timestamp":1569450122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-017-0481-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,14]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["481"],"URL":"https:\/\/doi.org\/10.1007\/s10100-017-0481-z","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2017,6,14]]}}}