A monotone approximation algorithm for scheduling with precedence constraints

DOI10.1016/j.orl.2007.05.003zbMath1144.90384OpenAlexW2073084198WikidataQ57851452 ScholiaQ57851452MaRDI QIDQ935240

Rob van Stee, Stephan Westphal, Anne Schwahn, Sven O. Krumke

Publication date: 6 August 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.05.003

zbMATH Keywords

schedulingprecedence constraintsalgorithmic mechanism design

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

An improved monotone algorithm for scheduling related machines with precedence constraints ⋮ A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient scheduling of tasks without full use of processor resources
• 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
• STACS 2004
• Algorithms – ESA 2005
• Bounds for Certain Multiprocessing Anomalies
• STACS 2005

This page was built for publication: A monotone approximation algorithm for scheduling with precedence constraints