Eisenbrand, FriedrichRothvoß, Thomas2008-08-212008-08-212008-08-21200810.1007/978-3-540-70575-8_21https://infoscience.epfl.ch/handle/20.500.14299/27423WOS:000258073400021We 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 algorithmcomputes an assignment using atmost (1+ε)·OPT +1 processors in polynomial time, which is feasible if the processors have speed 1+ε. We also show that, unless P = NP, there does not exist an asymptotic FPTAS for this problem.real-time schedulingapproximation algorithmstext::conference output::conference proceedings::conference paper