We consider the problem of assigning a set of jobs to m parallel related machines so as to maximize the minimum load over the machines. This situation corresponds to a case that a system which consists of the m machines is alive (i.e. productive) only when all machines are alive, and the system should be maintained alive as long as possible. The above problem is called related machines covering problem and is different from the related machines scheduling problem in which the goal is to minimize the maximum load. Our main result is a polynomial approximation scheme for this covering problem. To the best of our knowledge the previous best approximation algorithm has a performance ratio of 2. Also, an approximation scheme for the special case of identical machines was given by . Some of our techniques are built on ideas of Hochbaum and Shmoys . They provided an approximation scheme for the well known related machines scheduling. In fact, our algorithm can be adapted to provide a simpler approximation scheme for the related machines scheduling as Well.
|Title of host publication||Approximation Algorithms for Combinatorial Optimization - International Workshop, APPROX 1998, Proceedings|
|Editors||José Rolim, Klaus Jansen|
|Number of pages||9|
|ISBN (Print)||3540647368, 9783540647362|
|State||Published - 1998|
|Event||International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1998 - Aalborg, Denmark|
Duration: 18 Jul 1998 → 19 Jul 1998
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1998|
|Period||18/07/98 → 19/07/98|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)