Skip to main content
SpringerLink
Log in

Preemptive Online Scheduling: Optimal Algorithms for All Speeds

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet it is optimal even among all randomized algorithms. In addition, it is optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. Together with a new lower bound it follows that the overall competitive ratio of this optimal algorithm is between 2.054 and e≈2.718. We also give a complete analysis of the competitive ratio for three machines.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Albers, S.: On randomized online scheduling. In: Proc. 34th Symp. Theory of Computing (STOC), pp. 134–143. ACM, New York (2002)

    Google Scholar 

  2. Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. J. Algorithms 35, 108–121 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen, B., van Vliet, A., Woeginger, G.J.: Lower bounds for randomized online scheduling. Inf. Process. Lett. 51, 219–222 (1994)

    Article  MATH  Google Scholar 

  4. Chen, B., van Vliet, A., Woeginger, G.J.: An optimal algorithm for preemptive on-line scheduling. Oper. Res. Lett. 18, 127–131 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ebenlendr, T., Sgall, J.: Optimal and online preemptive scheduling on uniformly related machines. In: Proc. 21st Symp. on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Comput. Sci., vol. 2996, pp. 199–210. Springer, Berlin (2004)

    Google Scholar 

  6. Ebenlendr, T., Sgall, J.: Online preemptive scheduling on four uniformly related machines. In preparation

  7. Epstein, L.: Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios. Oper. Res. Lett. 29, 93–98 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Epstein, L., Noga, J., Seiden, S.S., Sgall, J., Woeginger, G.J.: Randomized on-line scheduling for two uniform machines. J. Sched. 4, 71–92 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Epstein, L., Sgall, J.: A lower bound for on-line scheduling on uniformly related machines. Oper. Res. Lett. 26(1), 17–22 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Fleischer, R., Wahl, M.: On-line scheduling revisited. J. Sched. 3, 343–353 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gonzales, T.F., Sahni, S.: Preemptive scheduling of uniform processor systems. J. ACM 25, 92–101 (1978)

    Article  Google Scholar 

  12. Graham, R., Lawler, E., Lenstra, J., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  13. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563–1581 (1966)

    Google Scholar 

  14. Hochbaum, D.S., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput. 17, 539–551 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  15. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34, 144–162 (1987)

    Article  MathSciNet  Google Scholar 

  16. Horwath, E., Lam, E.C., Sethi, R.: A level algorithm for preemptive scheduling. J. ACM 24, 32–43 (1977)

    Article  Google Scholar 

  17. McNaughton, R.: Scheduling with deadlines and loss functions. Manag. Sci. 6, 1–12 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  18. Rudin, J.F. III: Improved bound for the online scheduling problem. PhD thesis, The University of Texas at Dallas (2001)

  19. Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Inf. Process. Lett. 63, 51–55 (1997)

    Article  MathSciNet  Google Scholar 

  20. Tichý, T.: Randomized on-line scheduling on 3 processors. Oper. Res. Lett. 32, 152–158 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  21. Wen, J., Du, D.: Preemptive on-line scheduling for two uniform processors. Oper. Res. Lett. 23, 113–116 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, AS CR, Žitná 25, 11567, Praha 1, Czech Republic

    Tomáš Ebenlendr & Jiří Sgall

  2. Department of Computer Science, University of California, Riverside, CA, 92521, USA

    Wojciech Jawor

Authors
  1. Tomáš Ebenlendr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Jawor
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiří Sgall
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiří Sgall.

Additional information

T. Ebenlendr and J. Sgall partially supported by Institutional Research Plan No. AV0Z10190503, by Inst. for Theor. Comp. Sci., Prague (project 1M0545 of MŠMT ČR), grant 201/05/0124 of GA ČR, and grant IAA1019401 of GA AV ČR.

W. Jawor supported by NSF grants CCF-0208856 and OISE-0340752.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ebenlendr, T., Jawor, W. & Sgall, J. Preemptive Online Scheduling: Optimal Algorithms for All Speeds. Algorithmica 53, 504–522 (2009). https://doi.org/10.1007/s00453-008-9235-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-008-9235-6

Keywords

Search

Navigation