The exact LPT-bound for maximizing the minimum completion time

J. Csirik, Hans Kellerer, Gerhard Woeginger

Research output: Contribution to journalArticle

62 Citations (Scopus)

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 3 4. In this note we show that the exact worst case ratio of LPT is (3m - 1)/(4m - 2).

Original languageEnglish
Pages (from-to)281-287
Number of pages7
JournalOperations Research Letters
Volume11
Issue number5
DOIs
Publication statusPublished - 1992

Fingerprint

Completion Time
Maximise
Heuristics
Approximation

Keywords

  • combinatorial problems
  • scheduling
  • suboptimal algorithms

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Discrete Mathematics and Combinatorics
  • Modelling and Simulation

Cite this

The exact LPT-bound for maximizing the minimum completion time. / Csirik, J.; Kellerer, Hans; Woeginger, Gerhard.

In: Operations Research Letters, Vol. 11, No. 5, 1992, p. 281-287.

Research output: Contribution to journalArticle

Csirik, J. ; Kellerer, Hans ; Woeginger, Gerhard. / The exact LPT-bound for maximizing the minimum completion time. In: Operations Research Letters. 1992 ; Vol. 11, No. 5. pp. 281-287.
@article{182c5a27a08246049b797caf4ddb199b,
title = "The exact LPT-bound for maximizing the minimum completion time",
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 3 4. In this note we show that the exact worst case ratio of LPT is (3m - 1)/(4m - 2).",
keywords = "combinatorial problems, scheduling, suboptimal algorithms",
author = "J. Csirik and Hans Kellerer and Gerhard Woeginger",
year = "1992",
doi = "10.1016/0167-6377(92)90004-M",
language = "English",
volume = "11",
pages = "281--287",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "5",

}

TY - JOUR

T1 - The exact LPT-bound for maximizing the minimum completion time

AU - Csirik, J.

AU - Kellerer, Hans

AU - Woeginger, Gerhard

PY - 1992

Y1 - 1992

N2 - 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 3 4. In this note we show that the exact worst case ratio of LPT is (3m - 1)/(4m - 2).

AB - 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 3 4. In this note we show that the exact worst case ratio of LPT is (3m - 1)/(4m - 2).

KW - combinatorial problems

KW - scheduling

KW - suboptimal algorithms

UR - http://www.scopus.com/inward/record.url?scp=0026881284&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026881284&partnerID=8YFLogxK

U2 - 10.1016/0167-6377(92)90004-M

DO - 10.1016/0167-6377(92)90004-M

M3 - Article

AN - SCOPUS:0026881284

VL - 11

SP - 281

EP - 287

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 5

ER -