Precedence constrained scheduling in optimal

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.