An improved monotone algorithm for scheduling related machines with precedence constraints
DOI10.1016/J.ORL.2011.07.009zbMATH Open1235.90070OpenAlexW2003420442MaRDI QIDQ408428FDOQ408428
Authors: Anke van Zuylen 
Publication date: 5 April 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.07.009
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Parallel Machines On-Line
- Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
- An efficient approximation algorithm for minimizing makespan on uniformly related machines.
- Efficient scheduling of tasks without full use of processor resources
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
- A monotone approximation algorithm for scheduling with precedence constraints
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)
