We present a polynomial time approximation scheme for the
real-time scheduling problem with fixed priorities
when resource augmentation is allowed. For a fixed
> 0, our algorithm computes an assignment using at most (1 +
+ 1 processors in polynomial time, which is feasible if the processors have speed 1 +
. We also show that, unless
, there does not exist an asymptotic FPTAS for this problem.