Skip to main content
SpringerLink
Log in

Shortest Elapsed Time First Scheduling

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 40 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Bansal N, Dhamdhere K, Konemann J, Sinha A (2004) Non-clairvoyant scheduling for minimizing mean slowdown. Algorithmica 40(4):305–318

    Article  MathSciNet  MATH  Google Scholar 

  2. Bansal N, Pruhs K (2003) Server scheduling in the Lp norm: a rising tide lifts all boat. In: Symposium on theory of computing (STOC), San Diego, pp 242–250

    Google Scholar 

  3. Bansal N, Pruhs K (2004) Server scheduling in the weighted Lp norm. In: LATIN, Buenos Aires, pp 434–443

    MATH  Google Scholar 

  4. Chekuri C, Goel A, Khanna S, Kumar A (2004) Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In: Symposium on theory of computing (STOC), Chicago, pp 363–372

    Google Scholar 

  5. Kalyanasundaram B, Pruhs K (2000) Speed is as powerful as clairvoyance. J ACM 47(4):617–643

    Article  MathSciNet  MATH  Google Scholar 

  6. Kellerer H, Tautenhahn T, Woeginger GJ (1999) Approximability and nonapproximability results for minimizing total flow time on a single machine. SIAM J Comput 28(4):1155–1166

    Article  MathSciNet  MATH  Google Scholar 

  7. Motwani R, Phillips S, Torng E (1994) Non-clairvoyant scheduling. Theor Comput Sci 130(1):17–47

    Article  MathSciNet  MATH  Google Scholar 

  8. Muthukrishnan S, Rajaraman R, Shaheen A, Gehrke J (2004) Online scheduling to minimize average stretch. SIAM J Comput 34(2):433–452

    Article  MathSciNet  MATH  Google Scholar 

  9. Nutt G (1999) Operating system projects using Windows NT. Addison Wesley, Reading

    Google Scholar 

  10. Tanenbaum AS (1992) Modern operating systems. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Eindhoven University of Technology, Eindhoven, The Netherlands

    Nikhil Bansal

Authors
  1. Nikhil Bansal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nikhil Bansal .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Bansal, N. (2016). Shortest Elapsed Time First Scheduling. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_369

Download citation

Publish with us

Policies and ethics

Search

Navigation