{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:38:25Z","timestamp":1759667905354},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,9,3]],"date-time":"2009-09-03T00:00:00Z","timestamp":1251936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s10878-009-9265-2","type":"journal-article","created":{"date-parts":[[2009,9,2]],"date-time":"2009-09-02T03:28:17Z","timestamp":1251862097000},"page":"458-480","source":"Crossref","is-referenced-by-count":10,"title":["Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in\u00a0semi on-line scheduling"],"prefix":"10.1007","volume":"21","author":[{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"first","affiliation":[]},{"given":"M. Grazia","family":"Speranza","sequence":"additional","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,3]]},"reference":[{"key":"9265_CR1","first-page":"285","volume":"8","author":"E Angelelli","year":"2000","unstructured":"Angelelli E (2000) Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks. Cent Eur J Oper Res 8:285\u2013295","journal-title":"Cent Eur J Oper Res"},{"key":"9265_CR2","doi-asserted-by":"crossref","unstructured":"Angelelli E, Speranza MG, Szoldatics J, Tuza Zs (2009) Geometric representation for semi on-line scheduling on uniform processors. Optim Methods Softw, in print","DOI":"10.1080\/10556780903239311"},{"key":"9265_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00453-003-1037-2","volume":"37","author":"E Angelelli","year":"2003","unstructured":"Angelelli E, Speranza MG, Tuza Zs (2003) Semi on-line scheduling on two parallel processors with upper bound on the items. Algorithmica 37:243\u2013262","journal-title":"Algorithmica"},{"key":"9265_CR4","first-page":"1","volume":"8","author":"E Angelelli","year":"2006","unstructured":"Angelelli E, Speranza MG, Tuza Zs (2006) New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discrete Math Theor Comp Sci 8:1\u20136","journal-title":"Discrete Math Theor Comp Sci"},{"key":"9265_CR5","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 Zs (2008) Semi-online scheduling on two uniform processors. Theor Comp Sci 393:211\u2013219","journal-title":"Theor Comp Sci"},{"key":"9265_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(00)00258-9","volume":"168","author":"Y Azar","year":"2001","unstructured":"Azar Y, Regev O (2001) On-line bin-stretching. Theor Comp Sci 168:17\u201341","journal-title":"Theor Comp Sci"},{"key":"9265_CR7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y Cho","year":"1980","unstructured":"Cho Y, Sahni S (1980) Bounds for list schedules on uniform processors. SIAM J Comput 9:91\u2013103","journal-title":"SIAM J Comput"},{"key":"9265_CR8","first-page":"355","volume":"72","author":"Gy D\u00f3sa","year":"2004","unstructured":"D\u00f3sa Gy, He Y (2004) Semi on-line algorithms for parallel machine scheduling problems. Computing 72:355\u2013363","journal-title":"Computing"},{"key":"9265_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00607-005-0130-6","volume":"76","author":"Gy D\u00f3sa","year":"2006","unstructured":"D\u00f3sa Gy, He Y (2006) Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines. Computing 76:149\u2013164","journal-title":"Computing"},{"key":"9265_CR10","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":"9265_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/jos.60","volume":"4","author":"L Epstein","year":"2001","unstructured":"Epstein L, Noga J, Seiden S, Sgall J, Woeginger G (2001) Randomized on-line scheduling on two uniform machines. J Sched 4:71\u201392","journal-title":"J Sched"},{"key":"9265_CR12","doi-asserted-by":"crossref","unstructured":"Epstein L, Favrholdt LM (2002) Optimal non-preemptive semi-online scheduling on two related machines. In: Proceedings of the 27th MFCS, pp\u00a0245\u2013256","DOI":"10.1007\/3-540-45687-2_20"},{"key":"9265_CR13","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Techn J 45:1563\u20131581","journal-title":"Bell Syst Techn J"},{"key":"9265_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s006070050020","volume":"62","author":"Y He","year":"1999","unstructured":"He Y, Zhang G (1999) Semi on-line scheduling on two identical machines. Computing 62:179\u2013187","journal-title":"Computing"},{"key":"9265_CR15","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 Zs (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21:235\u2013242","journal-title":"Oper Res Lett"},{"key":"9265_CR16","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1016\/j.tcs.2008.11.018","volume":"410","author":"CT Ng","year":"2009","unstructured":"Ng CT, Tan Z, He Y, Cheng TCE (2009) Two uniform semi-online scheduling problems on two uniform machines. Theor Comp Sci. 410:776\u2013792. doi: 10.1016\/j.tcs.2008.11.018","journal-title":"Theor Comp Sci"},{"key":"9265_CR17","first-page":"15-1","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-T (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca Raton, pp\u00a015-1\u201315-41 (Chapter 15)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9265-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9265-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9265-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9265-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,3]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["9265"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9265-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,3]]}}}