A generalized bound on Lpt sequencing

E. G. Coffman, Ravi Sethi

Research output: Contribution to conferencePaperpeer-review

22 Scopus citations

Abstract

For a number of NP-complete sequencing problems [C], the worst-case performance of heuristics has been bounded relative to optimal performance. The bounds are usually shown to be best in the sense that they are achievable. However, when these bounds are based on a single, pathological example, they are not as informative as might be desired. Such is largely the case with Graham's bound [G] of 4/3- 1/3m on the performance of largest-processing-time- first (LPT) sequencing for the classical problem of minimizing schedule lengths, assuming independent tasks on m ≥ 2 identical processors.

Original languageEnglish (US)
Pages306-310
Number of pages5
DOIs
StatePublished - Mar 29 1976
Externally publishedYes
Event1976 ACM SIGMETRICS Conference on Computer Performance Modeling Measurement and Evaluation, SIGMETRICS 1976 - Cambridge, United States
Duration: Mar 29 1976Mar 31 1976

Other

Other1976 ACM SIGMETRICS Conference on Computer Performance Modeling Measurement and Evaluation, SIGMETRICS 1976
Country/TerritoryUnited States
CityCambridge
Period3/29/763/31/76

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'A generalized bound on Lpt sequencing'. Together they form a unique fingerprint.

Cite this