Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
From MaRDI portal
Publication:727980
DOI10.1007/S00453-016-0148-5zbMath1352.90038OpenAlexW2344553157MaRDI QIDQ727980
Jiamou Liu, Mikhail Kokho, Alex Gavryushkin, Bakhadyr Khoussainov
Publication date: 21 December 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0148-5
Cites Work
- Unnamed Item
- Unnamed Item
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Scheduling jobs with fixed start and end times
- On the computational complexity of (maximum) class scheduling
- An analysis of shift class design problems
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- On the approximability of an interval scheduling problem
- A data structure for dynamic trees
- From automatic structures to automatic groups.
- Dynamising Interval Scheduling: The Monotonic Case
- Tight approximation algorithms for scheduling with fixed jobs and nonavailability
- Interval scheduling: A survey
- Dynamic rectangular intersection with priorities
- An Optimal Solution for the Channel-Assignment Problem
- Minimal Resources for Fixed and Variable Job Schedules
- Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
This page was built for publication: Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
