A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

DOI10.1007/978-3-540-70575-8_21zbMath1152.90438OpenAlexW1900072645MaRDI QIDQ3521924

Friedrich Eisenbrand, Thomas Rothvoß

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_21

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (2)

A constant-approximate feasibility test for multiprocessor real-time scheduling ⋮ Open problems in real-time scheduling

This page was built for publication: A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation