Approximating interval selection on unrelated machines with unit-length intervals and cores
From MaRDI portal
Publication:2835690
Recommendations
Cites work
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Complexity results for scheduling tasks with discrete starting times
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Interval scheduling on identical machines
- Interval scheduling: A survey
- Interval selection with machine-dependent intervals
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- On the approximability of an interval scheduling problem
- On the complexity of scheduling tasks with discrete starting times
- Scheduling jobs with fixed start and end times
Cited in
(2)
This page was built for publication: Approximating interval selection on unrelated machines with unit-length intervals and cores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835690)