Algorithms and complexity for periodic real-time scheduling. (English) Zbl 1288.90021
Charikar, Moses (ed.), Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17–19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-0-89871-698-6/CD-ROM). 1350-1359 (2010).
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
| 68W25 | Approximation algorithms |
| 68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
| 68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |
