Skip to main content
SpringerLink
Log in

A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We consider one-by-one online scheduling on uniformly related machines. The input is a sequence of machines with different speeds and a sequence of jobs with different processing times. The output is a schedule which assigns the jobs to the machines; the completion time of a machine is the sum of the processing times of jobs assigned to it divided by its speed. The objective is to minimize the maximal completion time. The jobs arrive one by one and each has to be assigned to one machine immediately and irrevocably without the knowledge of the future jobs. We prove a new lower bound of 2.564 on the competitive ratio of deterministic online algorithms for this problem, improving the previous lower bound of 2.438.

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

Fig. 1

Similar content being viewed by others

References

  1. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line load balancing with applications to machine scheduling and virtual circuit routing. J. ACM 44, 486–504 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Azar, Y.: On-line load balancing. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 178–195. Springer, Berlin (1998)

    Chapter  Google Scholar 

  3. Bar-Noy, A., Freund, A., Naor, J.: New algorithms for related machines with temporary jobs. J. Sched. 3, 259–272 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. In: Proc. 5th Workshop on Algorithms and Data Structures (WADS). Lecture Notes in Comput. Sci., vol. 1272, pp. 116–125. Springer, Berlin (1997)

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Cai, S.Y., Yang, Q.F.: Online scheduling on three uniform machines. Discrete Appl. Math. 160, 291–302 (2011)

    Article  MathSciNet  Google Scholar 

  7. Cho, Y., Sahni, S.: Bounds for list schedules on uniform processors. SIAM J. Comput. 9, 91–103 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ebenlendr, T.: Combinatorial algorithms for online problems: semi-online scheduling on related machines. PhD thesis, Charles University, Prague (2011)

  9. Ebenlendr, T., Jawor, W., Sgall, J.: Preemptive online scheduling: optimal algorithms for all speeds. Algorithmica 53, 504–522 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Han, F., Tan, Z., Yang, Y.: On the optimality of list scheduling for online uniform machines scheduling. Optim. Lett. 7, 1551–1571 (2012)

    Article  MathSciNet  Google Scholar 

  13. Jeż, Ł., Schwartz, J., Sgall, J., Békési, J.: Lower bounds for online makespan minimization on a small number of related machines. J. Sched. (2012). doi:10.1007/s10951-012-0288-7

    Google Scholar 

  14. Musitelli, A., Nicoletti, J.M.: Competitive ratio of list scheduling on uniform machines and randomized heuristics. J. Sched. 14, 89–101 (2011)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgements

We are grateful to anonymous reviewers and György Dósa for helpful comments.

Author information

Authors and Affiliations

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

    Tomáš Ebenlendr

  2. Faculty of Mathematics and Physics, Computer Science Inst. of Charles University, Malostranské nám. 25, 11800, Praha 1, Czech Republic

    Jiří Sgall

Authors
  1. Tomáš Ebenlendr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiří Sgall
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiří Sgall.

Additional information

Partially supported by the Center of Excellence—Inst. for Theor. Comp. Sci., Prague (project P202/12/G061 of GA ČR) and grant IAA100190902 of GA AV ČR.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ebenlendr, T., Sgall, J. A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption. Theory Comput Syst 56, 73–81 (2015). https://doi.org/10.1007/s00224-013-9451-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-013-9451-6

Keywords

Search

Navigation