The exact LPT-bound for maximizing the minimum completion time

Authors:
János Csirik;Hans Kellerer;Gerhard Woeginger
Affiliations:
József Attila University, Department of Applied Computer Sciences, Szeged, Hungary;Universität Graz, Institut für Statistik und Operations Research, Graz, Austria;Technische Universität Graz, Institut für Mathematik B, Graz, Austria
Venue:
Operations Research Letters
Year:
1992

Citing 1
Cited 11

A performance guarantee for the greedy set-partitioning algorithm

Acta Informatica

The Santa Claus problem

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Optimal semi-online algorithms for machine covering

Theoretical Computer Science
k-Partitioning problems with partition matroid constraint

Theoretical Computer Science
Semi-online machine covering for two uniform machines

Theoretical Computer Science
Maximizing the minimum load for selfish agents

Theoretical Computer Science
Note: Tight bounds for bandwidth allocation on two links

Discrete Applied Mathematics
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data

Information and Computation
On-line machine covering on two machines with local migration

Computers & Mathematics with Applications
A polynomial-time approximation scheme for maximizing the minimum machine completion time

Operations Research Letters
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times11Supported partially by State Science and Technology Commission and National Natural Science Foundation of China.

Operations Research Letters
A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of assigning a set of jobs to a system of m identical processors in order to maximize the earliest processor completion time. It was known that the LPT-heuristic gives an approximation of worst case ratio at most 34. In this note we show that the exact worst case ratio of LPT is (3m - 1)/(4m - 2).