An improved monotone algorithm for scheduling related machines with precedence constraints
From MaRDI portal
Publication:408428
Recommendations
Cites work
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
- A monotone approximation algorithm for scheduling with precedence constraints
- An efficient approximation algorithm for minimizing makespan on uniformly related machines.
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- Efficient scheduling of tasks without full use of processor resources
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Parallel Machines On-Line
Cited in
(3)
This page was built for publication: An improved monotone algorithm for scheduling related machines with precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408428)