Mathematical Programming

, Volume 46, Issue 1, pp 259–271

Approximation algorithms for scheduling unrelated parallel machines

Authors

  • Jan Karel Lenstra
    • Eindhoven University of Technology
    • Centre for Mathematics and Computer Science
  • David B. Shmoys
    • Cornell University
  • Éva Tardos
    • Cornell University
Article

DOI: 10.1007/BF01585745

Cite this article as:
Lenstra, J.K., Shmoys, D.B. & Tardos, É. Mathematical Programming (1990) 46: 259. doi:10.1007/BF01585745

Abstract

We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timepij. The objective is to find a schedule that minimizes the makespan.

Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints.

In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.

Key words

Schedulingparallel machinesapproximation algorithmworst case analysislinear programminginteger programmingrounding

Copyright information

© North-Holland 1990