Abstract
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4 competitive deterministic and e≈ 2.71 competitive randomized online algorithms. In addition, it matches the performance of the previously known algorithms for the offline case, with a considerably simpler proof. Finally, we study the performance of greedy heuristics for the same problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line load balancing with applications to machine scheduling and virtual circuit routing. Journal of the ACM 44, 486–504 (1997)
Bar-Noy, A., Freund, A., Naor, J.: New algorithms for related machines with temporary jobs. Journal of Scheduling 3, 259–272 (2000)
Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. Journal of Algorithms 35, 108–121 (2000)
Chen, B., van Vliet, A., Woeginger, G.J.: An optimal algorithm for preemptive on-line scheduling. Operations Research Letters 18, 127–131 (1995)
Cho, Y., Sahni, S.: Bounds for list schedules on uniform processors. SIAM Journal on Computing 9, 91–103 (1980)
Dobson, G.: Scheduling independent tasks on uniform processors. SIAM Journal on Computing 13, 705–716 (1984)
Epstein, L.: Optimal preemptive scheduling on uniform processors with nondecreasing speed ratios. Operations Research Letters 29, 93–98 (2001)
Epstein, L.: Bin stretching revisited. Acta Informatica 39, 97–117 (2003)
Epstein, L., Favrholdt, L.M.: Optimal preemptive semi-online scheduling to minimize makespan on two related machines. Operations Research Letters 30, 269–275 (2002)
Epstein, L., Noga, J., Seiden, S.S., Sgall, J., Woeginger, G.J.: Randomized on-line scheduling for two related machines. Journal of Scheduling 4, 71–92 (2001)
Epstein, L., Sgall, J.: A lower bound for on-line scheduling on uniformly related machines. Operations Research Letters 26(1), 17–22 (2000)
Friesen, D.K.: Tighter bounds for LPT scheduling on uniform processors. SIAM Journal on Computing 16, 554–560 (1987)
Gonzales, T.F., Sahni, S.: Preemptive scheduling of uniform processor systems. Journal of the ACM 25, 92–101 (1978)
Horwath, E., Lam, E.C., Sethi, R.: A level algorithm for preemptive scheduling. Journal of the ACM 24, 32–43 (1977)
Shachnai, H., Tamir, T., Woeginger, G.J.: Minimizing Makespan and Preemption Costs on a System of Uniform Machines. In: Craw, S., Preece, A.D. (eds.) ECCBR 2002. LNCS (LNAI), vol. 2416, pp. 859–871. Springer, Heidelberg (2002)
Shmoys, D.B., Wein, J., Williamson, D.P.: Scheduling parallel machines on-line. SIAM Journal on Computing 24, 1313–1331 (1995)
Wen, J., Du, D.: Preemptive on-line scheduling for two uniform processors. Operations Research Letters 23, 113–116 (1998)
Woeginger, G.J.: A comment on scheduling on uniform machines under chain-type precedence constraints. Operations Research Letters 26, 107–109 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ebenlendr, T., Sgall, J. (2004). Optimal and Online Preemptive Scheduling on Uniformly Related Machines. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive