A New Insight into the Coffman-Graham Algorithm

Authors:
Bertrand Braschi;Denis Trystram
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1994

Citing 0
Cited 6

Spill-free parallel scheduling of basic blocks

Proceedings of the 28th annual international symposium on Microarchitecture
Scheduling loosely connected task graphs

Journal of Computer and System Sciences
Precedence constrained scheduling in (2-73p+1)·optimal

Journal of Computer and System Sciences
The worst-case analysis of the Garey---Johnson algorithm

Journal of Scheduling
Conditional hardness of precedence constrained scheduling on identical machines

Proceedings of the forty-second ACM symposium on Theory of computing
Hardness of Precedence Constrained Scheduling on Identical Machines

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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_{opt} - (m - 3)/m$, where $\omega_{opt}$ is the minimal makespan of a schedule.