Skip to main content
SpringerLink
Log in

Minimizing the Maximum Starting Time On-line

  • Conference paper
  • First Online:
Algorithms — ESA 2002 (ESA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2461))

Included in the following conference series:

Abstract

We study the schedulingp roblem of minimizing the maximum startingt ime on-line. The goal is to minimize the last time that a job starts. We show that while the greedy algorithm has a competitive ratio of θ(log m), we can give a constant competitive algorithm for this problem. We also show that the greedy algorithm is optimal for resource augmentation in the sense that it requires 2m - 1 machines to have a competitive ratio of 1, whereas no algorithm can achieve this with 2m - 2 machines.

Research supported by Israel Science Foundation (grant no. 250/01)

This work done while the author was at the CWI, The Netherlands. Research supported by the Netherlands Organization for Scientific Research (NWO), project number SION 612-30-002

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Albers. On the influence of lookahead in competitive paging algorithms. Algorithmica, 18(3):283–305, Jul 1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. Avidor, Y. Azar, and J. Sgall. Ancient and new algorithms for load balancing in the l p norm. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pages 426–435, 1998.

    Google Scholar 

  3. Y. Azar, L. Epstein, and R. van Stee. Resource augmentation in load balancing. Journal of Scheduling, 3(5):249–258, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  4. Y. Bartal, A. Fiat, H. Karlo., and R. Vohra. New algorithms for an ancient scheduling problem. In Proc. 24th ACM Symposium on Theory of Algorithms, pages 51–58, 1992. To appear in Journal of Computer and System Sciences.

    Google Scholar 

  5. P. Berman and C. Coulston. Speed is more powerful than clairvoyance. Nordic Journal of Computing, 6:181–193, 1999.

    MATH  MathSciNet  Google Scholar 

  6. M. Brehob, E. Torng, and P. Uthaisombut. Applying extra-resource analysis to load balancing. Journal of Scheduling, 3(5):273–288, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Edmonds. Schedulingi n the dark. Theoretical Computer Science, 235:109–141, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Fleischer and M. Wahl. Online scheduling revisited. Journal of Scheduling, 3(5):343–353, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  9. T. Gormley, N. Reingold, E. Torng, and J. Westbrook. Generating adversaries for request-answer games. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 564–565. ACM-SIAM, 2000.

    Google Scholar 

  10. R. L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563–1581, 1966.

    Google Scholar 

  11. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47:617–643, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  12. Bala Kalyanasundaram and Kirk Pruhs. Maximizingj ob completions online. In G. Bilardi, G. F. Italiano, A. Pietracaprina, and G. Pucci, editors, Algorithms-ES’98, Proceedings Sixth Annual European Symposium, volume 1461 of Lecture Notes in Computer Science, pages 235–246. Springer, 1998. To appear in Journal of Algorithms.

    Google Scholar 

  13. D.R. Karger, S. J. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. Journal of Algorithms, 20:400–430, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  14. C.A. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation. Algorithmica, 32(2):163–200, 2002.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, The Interdisciplinary Center, Herzliya, Israel

    Leah Epstein

  2. Institut für Informatik, Albert-Ludwigs-Universität, Georges-Köhler-Allee, 79110, Freiburg, Germany

    Rob van Stee

Authors
  1. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rob van Stee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät II: Mathematik und Naturwissenschaften, Technische Universität Berlin, Strasse des 17. Juni 136, 10623, Berlin, Germany

    Rolf Möhring

  2. Department of Mathematics and Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Rajeev Raman

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Epstein, L., van Stee, R. (2002). Minimizing the Maximum Starting Time On-line. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-45749-6_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44180-9

  • Online ISBN: 978-3-540-45749-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation