Online interval scheduling with a bounded number of failures
From MaRDI portal
Publication:1707823
DOI10.1007/s10951-016-0506-9zbMath1391.90242OpenAlexW2573305935MaRDI QIDQ1707823
Stephan Westphal, Marco Bender, Clemens Thielen
Publication date: 4 April 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-016-0506-9
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-preemptive speed scaling
- Interval scheduling on related machines
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Real-time scheduling to minimize machine busy times
- A note on the \(k\)-Canadian traveller problem
- Improved randomized results for the interval selection problem
- Scheduling jobs with fixed start and end times
- Randomized online interval scheduling
- On-line scheduling of jobs with fixed start and end times
- Note on scheduling intervals on-line
- On the \(k\)-coloring of intervals
- An improved randomized on-line algorithm for a weighted interval selection problem
- Interval scheduling on identical machines
- Tight Approximation Algorithms for Maximum Separable Assignment Problems
- New Results for Non-Preemptive Speed Scaling
- Online Scheduling of Jobs with Fixed Start Times on Related Machines
- Interval scheduling: A survey
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
- An Optimal Solution for the Channel-Assignment Problem
- Bounding the Power of Preemption in Randomized Scheduling
This page was built for publication: Online interval scheduling with a bounded number of failures
