Approximating interval selection on unrelated machines with unit-length intervals and cores
DOI10.1007/978-3-319-45587-7_30zbMATH Open1445.90031OpenAlexW2511121390MaRDI QIDQ2835690FDOQ2835690
Authors: Kateřina Böhmová, Enrico Kravina, Matúš Mihalák 
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_30
Recommendations
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Scheduling jobs with fixed start and end times
- Interval scheduling: A survey
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- On the approximability of an interval scheduling problem
- Interval scheduling on identical machines
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- On the complexity of scheduling tasks with discrete starting times
- Complexity results for scheduling tasks with discrete starting times
- Interval selection with machine-dependent intervals
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)
