Advertisement

Minimum Makespan Scheduling

  • Vijay V. Vazirani
Chapter

Abstract

A central problem in scheduling theory is the following.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 119.
    R.L. Graham. Bounds for certain multiprocessing anomalies Bell System Technical Journal, 45: 1563–1581, 1966.CrossRefGoogle Scholar
  2. 135.
    D.S. Hochbaum and D.B. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM, 34: 144–162, 1987.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations