Approximating an interval scheduling problem
From MaRDI portal
Recommendations
Cited in
(17)- Approximate solution of a resource-constrained scheduling problem
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- The triangle scheduling problem
- Conversion of coloring algorithms into maximum weight independent set algorithms
- Approximation of the supply scheduling problem
- On the approximability of an interval scheduling problem
- GreedyMAX-type algorithms for the maximum independent set problem
- Approximating Interval Scheduling Problems with Bounded Profits
- scientific article; zbMATH DE number 15416 (Why is no real title available?)
- Computing and Combinatorics
- scientific article; zbMATH DE number 850325 (Why is no real title available?)
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- scientific article; zbMATH DE number 2221455 (Why is no real title available?)
- scientific article; zbMATH DE number 7650890 (Why is no real title available?)
- scientific article; zbMATH DE number 7765369 (Why is no real title available?)
- Application of the interpolation approach for approximating single-machine scheduling problem with an unknown objective function
- Approximations for Throughput Maximization
This page was built for publication: Approximating an interval scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400854)