×

zbMATH — the first resource for mathematics

A new insight into the Coffman-Graham algorithm. (English) Zbl 0827.90069
The classical scheduling problem is considered: \(n\) unit length nonpreemptable tasks forming an arbitrary precedence graph are to be scheduled on \(m\) identical processors. The authors analyze the worst case behavior of the Coffman-Graham algorithm, correcting previous bounds given by Lam and Sethi.

MSC:
90B35 Deterministic scheduling theory in operations research
PDF BibTeX XML Cite
Full Text: DOI