Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Approximation and Online Algorithms

WAOA 2011: Approximation and Online Algorithms pp 102–108Cite as

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7164))

Abstract

We prove a new lower bound of 2.564 on deterministic online algorithms for makespan scheduling on related machines (without preemptions). Previous lower bound was 2.438 by Berman et al. We use an analytical bound on maximal frequency of scheduling jobs instead of the combinatorial bound obtained by computer based search through the graph of possible states of an algorithm in the previous work.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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  MathSciNet  MATH  Google Scholar 

  2. Azar, Y.: On-line Load Balancing. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art. LNCS, vol. 1442, pp. 178–195. Springer, Heidelberg (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  MathSciNet  MATH  Google Scholar 

  4. Berman, P., Charikar, M., Karpinski, M.: On-line Load Balancing for Related Machines. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 116–125. Springer, Heidelberg (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  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. 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  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Tomáš Ebenlendr

  2. Dept. of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské nám. 25, CZ-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

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, ON, Canada

    Roberto Solis-Oba

  2. Dipartimento di Informatica "Renato M. Capocelli", Università di Salerno, Via Ponte Don Melillo, 84081, Fisciano, SA, Italy

    Giuseppe Persiano

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ebenlendr, T., Sgall, J. (2012). A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption. In: Solis-Oba, R., Persiano, G. (eds) Approximation and Online Algorithms. WAOA 2011. Lecture Notes in Computer Science, vol 7164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29116-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29116-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29115-9

  • Online ISBN: 978-3-642-29116-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation