{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:57:53Z","timestamp":1725537473551},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_41","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"456-467","source":"Crossref","is-referenced-by-count":7,"title":["Preemptive Online Scheduling with Reordering"],"prefix":"10.1007","author":[{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","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. Information Processing Letters\u00a051, 219\u2013222 (1994)","journal-title":"Information Processing Letters"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Chen, B., van Vliet, A., Woeginger, G.J.: An optimal algorithm for preemptive on-line scheduling. Operations Research Letters\u00a018, 127\u2013131 (1995); Also in ESA 1994","DOI":"10.1016\/0167-6377(95)00039-9"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"D\u00f3sa, G., Epstein, L.: Online scheduling with a buffer on related machines. Journal of Combinatorial Optimization (2008) (to appear)","DOI":"10.1007\/s10878-008-9200-y"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/11841036_31","volume-title":"Algorithms \u2013 ESA 2006","author":"T. Ebenlendr","year":"2006","unstructured":"Ebenlendr, T., Jawor, W., Sgall, J.: Preemptive online scheduling: Optimal algorithms for all speeds. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 327\u2013339. Springer, Heidelberg (2006)"},{"key":"41_CR5","unstructured":"Ebenlendr, T., Sgall, J.: Semi-online preemptive scheduling: One algorithm for all variants. In: Proc. of the 26th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2009 (to appear, 2009)"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Englert, M., \u00d6zmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. In: Proc. 48th Symp. Foundations of Computer Science (FOCS), pp. 603\u2013612 (2008)","DOI":"10.1109\/FOCS.2008.46"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Epstein, L.: Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios. Operations Research Letters\u00a029(2), 93\u201398 (2001); Also in STACS 2001","DOI":"10.1016\/S0167-6377(01)00085-2"},{"issue":"4","key":"41_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0167-6377(02)00179-7","volume":"30","author":"L. Epstein","year":"2002","unstructured":"Epstein, L., Favrholdt, L.M.: Optimal preemptive semi-online scheduling to minimize makespan on two related machines. Operations Research Letters\u00a030(4), 269\u2013275 (2002)","journal-title":"Operations Research Letters"},{"issue":"2","key":"41_CR9","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 online scheduling on two uniform machines. Journal of Scheduling\u00a04(2), 71\u201392 (2001)","journal-title":"Journal of Scheduling"},{"issue":"1","key":"41_CR10","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. Operations Research Letters\u00a026(1), 17\u201322 (2000)","journal-title":"Operations Research Letters"},{"key":"41_CR11","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. Journal of the ACM\u00a024, 32\u201343 (1977)","journal-title":"Journal of the ACM"},{"key":"41_CR12","doi-asserted-by":"publisher","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.: Semi online algorithms for the partition problem. Operations Research Letters\u00a021, 235\u2013242 (1997)","journal-title":"Operations Research Letters"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Li, S., Zhou, Y., Sun, G., Chen, G.: Study on parallel machine scheduling problem with buffer. In: Proc. of the 2nd International Multisymposium on Computer and Computational Sciences (IMSCCS 2007), pp. 278\u2013281 (2007)","DOI":"10.1109\/IMSCCS.2007.32"},{"issue":"1-2","key":"41_CR14","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"S. Seiden","year":"2001","unstructured":"Seiden, S.: Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science\u00a0262(1-2), 437\u2013458 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"41_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0167-6377(00)00053-5","volume":"27","author":"S. Seiden","year":"2000","unstructured":"Seiden, S., Sgall, J., Woeginger, G.: Semi-online scheduling with decreasing job sizes. Operations Research Letters\u00a027(5), 215\u2013221 (2000)","journal-title":"Operations Research Letters"},{"issue":"1","key":"41_CR16","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. Information Processing Letters\u00a063(1), 51\u201355 (1997)","journal-title":"Information Processing Letters"},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"Online Algorithms - The State of the Art","author":"J. Sgall","year":"1998","unstructured":"Sgall, J.: On-line scheduling. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms - The State of the Art, ch. 9, pp. 196\u2013231. Springer, Heidelberg (1998)"},{"key":"41_CR18","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. Operations Research Letters\u00a023, 113\u2013116 (1998)","journal-title":"Operations Research Letters"},{"key":"41_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(97)00006-9","volume":"61","author":"G. Zhang","year":"1997","unstructured":"Zhang, G.: A simple semi on-line algorithm for P2\/\/C max with a buffer. Information Processing Letters\u00a061, 145\u2013148 (1997)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:29Z","timestamp":1558524149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}