The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many
industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of
scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even
if we allow “slow” machines to remain idle.
Keywords Approximation algorithm - chains - constraints - scheduling