Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 2004: Algorithm Theory - SWAT 2004 pp 420–430Cite as

The Optimal Online Algorithms for Minimizing Maximum Lateness

  • Conference paper

  • 1371 Accesses

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

Abstract

It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arrive over time on a single machine to minimize maximum lateness. It was not previously known what other online algorithms are optimal for this problem. A complete characterization of all optimal online algorithms for this problem is given.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Baker, K.R.: Introduction to Sequencing and Scheduling, ch-2. Wiley, New York (1974)

    Google Scholar 

  2. Dertouzos, M., Mok, A.: Multiprocessor on-line scheduling of hard-real-time tasks. IEEE Transactions on Software Engineering 15, 1497–1506 (1989)

    Article  Google Scholar 

  3. Dertouzos, M.L.: Control robotics: the procedural control of physical processes. In: Proceeding of IFIP Congress, pp. 807–813 (1974)

    Google Scholar 

  4. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  5. Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 140–149 (1997)

    Google Scholar 

  6. Rasala, A., Stein, C., Torng, E., Uthaisombut, P.: Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 723–731 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Pittsburgh, USA

    Patchrawat Uthaisombut

Authors
  1. Patchrawat Uthaisombut
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Augsburg, 86135, Augsburg, Germany

    Torben Hagerup

  2. Department of Computing, University of Copenhagen, Denmark

    Jyrki Katajainen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Uthaisombut, P. (2004). The Optimal Online Algorithms for Minimizing Maximum Lateness. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27810-8_36

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-27810-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation