Sciweavers

Share
JCSS
2008

Precedence constrained scheduling in (2 - 7/(3p+1)) optimal

10 years 4 months ago
Precedence constrained scheduling in (2 - 7/(3p+1)) optimal
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as long as the optimal, where p > 3 is the number of processors. This improves upon a long standing bound of 2 - 2 p due to Coffman and Graham. 1
Devdatta Gangal, Abhiram G. Ranade
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2008
Where JCSS
Authors Devdatta Gangal, Abhiram G. Ranade
Comments (0)
books