Real-time scheduling to minimize machine busy times
From MaRDI portal
Publication:906551
DOI10.1007/s10951-014-0411-zzbMath1333.90046OpenAlexW2023661795MaRDI QIDQ906551
Hadas Shachnai, Rohit Khandekar, Tami Tamir, Baruch Schieber
Publication date: 22 January 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-014-0411-z
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (6)
Scheduling maintenance jobs in networks ⋮ Online interval scheduling with a bounded number of failures ⋮ Minimizing total busy time in parallel scheduling with application to optical networks ⋮ Cost-sharing games in real-time scheduling systems ⋮ Cost-sharing games in real-time scheduling systems ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating the traffic grooming problem in tree and star networks
- Optimizing busy time on parallel machines
- Minimizing total busy time in parallel scheduling with application to optical networks
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Off-line admission control for general scheduling problems
- LP rounding and combinatorial algorithms for minimizing active and busy time
- Minimizing Busy Time in Multiple Machine Real-time Scheduling
- Algorithmic aspects of bandwidth trading
- An improved approximation algorithm for resource allocation
- Paths, Trees, and Flowers
- A unified approach to approximating resource allocation and scheduling
- Scheduling
This page was built for publication: Real-time scheduling to minimize machine busy times
