An improved monotone algorithm for scheduling related machines with precedence constraints

DOI10.1016/J.ORL.2011.07.009zbMath1235.90070OpenAlexW2003420442MaRDI QIDQ408428

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

zbMATH Keywords

schedulingprecedence constraintsalgorithmic mechanism designmonotone algorithms

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A monotone approximation algorithm for scheduling with precedence constraints
• Efficient scheduling of tasks without full use of processor resources
• An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
• A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
• Scheduling Parallel Machines On-Line

This page was built for publication: An improved monotone algorithm for scheduling related machines with precedence constraints