Scheduling on Unrelated Parallel Machines

  • Vijay V. Vazirani


LP-rounding has yielded approximation algorithms for a large number of NP-hard problems in scheduling theory (see Section 17.6). As an illustrative example, we present a factor 2 algorithm for the problem of scheduling on unrelated parallel machines. We will apply the technique of parametric pruning, introduced in Chapter 5, together with LP-rounding, to obtain the algorithm.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 191.
    J.K. Lenstra, D.B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46: 259–271, 1990.MathSciNetCrossRefGoogle Scholar
  2. 127.
    L.A. Hall. Approximation algorithms for scheduling. In D.S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 1–45. PWS Publishing, Boston, MA, 1997.Google 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