A New Insight into the Coffman–Graham Algorithm

Braschi, Bertrand; Trystram, Denis

doi:doi:10.1137/S0097539790181889

Keyword
DOI
Citation
Advanced Search

Search Content Type

article doi:

Citation:

You are not logged in Logged Out Log In

SIAM J. on Computing / Volume 23 / Issue 3

SIAM J. Comput. 23, pp. 662-669 (8 pages)

A New Insight into the Coffman–Graham Algorithm

Bertrand Braschi and Denis Trystram

Full Text: Download PDF | Buy PDF (US$25) | View Cart

Alerts
- Alert Me When Cited
- Alert Me When Corrected
Tools
Share
- Email Abstract
- Connotea
- CiteULike
- del.icio.us
- BibSonomy
- Tweet this Article
- Add to Facebook

Abstract

References (6)

Citing Articles (5)

The approximate solution of the $m$-machine problem is addressed. The Lam–Sethi worst-case analysis of the Coffman–Graham algorithm is set up to be partly incorrect. A slightly different context is set up to correct and complete this analysis. It is shown that the makespan of a schedule computed by an extended Coffman–Graham algorithm is lower than or at worst equal to $({{2 - 2} / m})\omega _{{\text{opt}}} - {{(m - 3)} / m}$, where $\omega _{{\text{opt}}} $ is the minimal makespan of a schedule.

KEYWORDS

Keywords

scheduling theory, worst-case analysis, list scheduling

AMS Subject Headings

90B35

PUBLICATION DATA

ISSN

0097-5397 (print)

1095-7111 (online)

Publisher

$abstract.society.value is a Member of CrossRef

ARTICLE DATA

History

Received May 21, 1990
Accepted October 16, 1992

Digital Object Identifier

http://dx.doi.org/10.1137/S0097539790181889

For access to fully linked references, you need to log in.

For access to citing articles, you need to log in.

A New Insight into the Coffman–Graham Algorithm