Online interval scheduling on two related machines: the power of lookahead
From MaRDI portal
Publication:2424805
DOI10.1007/s10878-019-00381-6zbMath1423.90098OpenAlexW2909709363WikidataQ128627932 ScholiaQ128627932MaRDI QIDQ2424805
Frits C. R. Spieksma, Nicolas Pinson
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00381-6
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Unnamed Item
- Online scheduling of jobs with fixed start times on related machines
- Mathematical programming models for lock scheduling with an emission objective
- The lockmaster's problem
- Online interval scheduling on a single machine with finite lookahead
- On-line scheduling of equal-length intervals on parallel machines
- Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem
- Interval scheduling on related machines
- Online scheduling with rearrangement on two related machines
- Online scheduling on semi-related machines
- Improved randomized results for the interval selection problem
- Online interval scheduling: Randomized and multiprocessor cases
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- On-line scheduling of jobs with fixed start and end times
- Online C-benevolent job scheduling on multiple machines
- Note on scheduling intervals on-line
- On the \(k\)-coloring of intervals
- Improved randomized online scheduling of intervals and jobs
- An improved randomized on-line algorithm for a weighted interval selection problem
- Scheduling Bidirectional Traffic on a Path
- Interval scheduling: A survey
- Interval selection: Applications, algorithms, and lower bounds
This page was built for publication: Online interval scheduling on two related machines: the power of lookahead
