Abstract We state some of the most important open algorithmic problems in real-time scheduling, and survey progress made on these problems since the 2009 Dagstuhl scheduling seminar. Keywords Real-time scheduling · Open problems
Sanjoy K. Baruah, Kirk Pruhs