{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:15:52Z","timestamp":1725470152456},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_31","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"327-339","source":"Crossref","is-referenced-by-count":7,"title":["Preemptive Online Scheduling: Optimal Algorithms for All Speeds"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Ebenlendr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Jawor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","first-page":"134","volume-title":"Proc. 34th Symp. Theory of Computing (STOC)","author":"S. Albers","year":"2002","unstructured":"Albers, S.: On randomized online scheduling. In: Proc. 34th Symp. Theory of Computing (STOC), pp. 134\u2013143. ACM Press, New York (2002)"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jagm.1999.1070","volume":"35","author":"P. Berman","year":"2000","unstructured":"Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. J. Algorithms\u00a035, 108\u2013121 (2000)","journal-title":"J. Algorithms"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0190(94)00110-3","volume":"51","author":"B. Chen","year":"1994","unstructured":"Chen, B., van Vliet, A., Woeginger, G.J.: Lower bounds for randomized online scheduling. Inform. Process. Lett.\u00a051, 219\u2013222 (1994)","journal-title":"Inform. Process. Lett."},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0167-6377(95)00039-9","volume":"18","author":"B. Chen","year":"1995","unstructured":"Chen, B., van Vliet, A., Woeginger, G.J.: An optimal algorithm for preemptive on-line scheduling. Oper. Res. Lett.\u00a018, 127\u2013131 (1995)","journal-title":"Oper. Res. Lett."},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-24749-4_18","volume-title":"STACS 2004","author":"T. Ebenlendr","year":"2004","unstructured":"Ebenlendr, T., Sgall, J.: Optimal and online preemptive scheduling on uniformly related machines. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 199\u2013210. Springer, Heidelberg (2004)"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0167-6377(01)00085-2","volume":"29","author":"L. Epstein","year":"2001","unstructured":"Epstein, L.: Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios. Oper. Res. Lett.\u00a029, 93\u201398 (2001)","journal-title":"Oper. Res. Lett."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/jos.60","volume":"4","author":"L. Epstein","year":"2001","unstructured":"Epstein, L., Noga, J., Seiden, S.S., Sgall, J., Woeginger, G.J.: Randomized on-line scheduling for two related machines. J. Sched.\u00a04, 71\u201392 (2001)","journal-title":"J. Sched."},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0167-6377(99)00062-0","volume":"26","author":"L. Epstein","year":"2000","unstructured":"Epstein, L., Sgall, J.: A lower bound for on-line scheduling on uniformly related machines. Oper. Res. Lett.\u00a026(1), 17\u201322 (2000)","journal-title":"Oper. Res. Lett."},{"key":"31_CR9","doi-asserted-by":"publisher","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.: On-line scheduling revisited. J. Sched.\u00a03, 343\u2013353 (2000)","journal-title":"J. Sched."},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/322047.322055","volume":"25","author":"T.F. Gonzales","year":"1978","unstructured":"Gonzales, T.F., Sahni, S.: Preemptive scheduling of uniform processor systems. J. ACM\u00a025, 92\u2013101 (1978)","journal-title":"J. ACM"},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical J.\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical J."},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/321992.321995","volume":"24","author":"E. Horwath","year":"1977","unstructured":"Horwath, E., Lam, E.C., Sethi, R.: A level algorithm for preemptive scheduling. J. ACM\u00a024, 32\u201343 (1977)","journal-title":"J. ACM"},{"key":"31_CR13","unstructured":"Rudin III, J.F.: Improved Bound for the Online Scheduling Problem. PhD thesis, The University of Texas at Dallas (2001)"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0020-0190(97)00093-8","volume":"63","author":"J. Sgall","year":"1997","unstructured":"Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Inform. Process. Lett.\u00a063, 51\u201355 (1997)","journal-title":"Inform. Process. Lett."},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.orl.2003.05.003","volume":"32","author":"T. Tich\u00fd","year":"2004","unstructured":"Tich\u00fd, T.: Randomized on-line scheduling on 3 processors. Oper. Res. Lett.\u00a032, 152\u2013158 (2004)","journal-title":"Oper. Res. Lett."},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0167-6377(98)00032-7","volume":"23","author":"J. Wen","year":"1998","unstructured":"Wen, J., Du, D.: Preemptive on-line scheduling for two uniform processors. Oper. Res. Lett.\u00a023, 113\u2013116 (1998)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:52Z","timestamp":1619507812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11841036_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}