| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 430751 | Journal of Computer and System Sciences | 2008 | 8 Pages |
Abstract
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most factor as long as the optimal, where p>3 is the number of processors. This improves upon a long standing bound of due to Coffman and Graham.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
