Competitive algorithms for multistage online scheduling
From MaRDI portal
Publication:1753459
DOI10.1016/j.ejor.2016.12.047zbMath1403.90335OpenAlexW2567804193MaRDI QIDQ1753459
Oliver Wendt, Michael Hopf, Clemens Thielen
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://kluedo.ub.uni-kl.de/files/4119/_Competitive%20Algorithms%20for%20Multistage%20Online%20Scheduling.pdf
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Multistage interval scheduling games ⋮ Separation routine and extended formulations for the stable set problem in claw-free graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online selection of intervals and \(t\)-intervals
- Interval scheduling on related machines
- Scheduling jobs with fixed start and end times
- Optimization, approximation, and complexity classes
- On-line scheduling of jobs with fixed start and end times
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Note on scheduling intervals on-line
- Online independent sets.
- On the \(k\)-coloring of intervals
- Interval scheduling on identical machines
- Improved Randomized Results for That Interval Selection Problem
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
- Bounding the Power of Preemption in Randomized Scheduling
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
- Programming with linear fractional functionals
- Scheduling Split Intervals
This page was built for publication: Competitive algorithms for multistage online scheduling
