scientific article; zbMATH DE number 850325
From MaRDI portal
Publication:4866348
Recommendations
- scientific article; zbMATH DE number 1560337
- On approximating a scheduling problem
- scientific article; zbMATH DE number 1182771
- Towards tight lower bounds for scheduling problems
- On the approximability of an interval scheduling problem
- On the optimality of exact and approximation algorithms for scheduling problems
- Approximate solution of a resource-constrained scheduling problem
- Approximating Interval Scheduling Problems with Bounded Profits
- Approximation algorithms for some discrete-continuous scheduling problems
- Approximation algorithms for time constrained scheduling
Cited in
(10)- Approximate solution of a resource-constrained scheduling problem
- Tighter approximation bounds for LPT scheduling in two special cases
- On Graham's bound for cyclic scheduling
- Approximation of the supply scheduling problem
- scientific article; zbMATH DE number 4131936 (Why is no real title available?)
- Bounds for naive multiple machine scheduling with release times and deadlines
- scientific article; zbMATH DE number 5125607 (Why is no real title available?)
- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
- Approximately Supermodular Scheduling Subject to Matroid Constraints
- scientific article; zbMATH DE number 7650890 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4866348)
