Article ID Journal Published Year Pages File Type
1143248 Operations Research Letters 2011 5 Pages PDF
Abstract
► We consider the problem of scheduling related machines with precedence constraints. ► We give an O(logm)-approximation algorithm that is monotone in expectation. ► This implies mechanism that is truthful when machines are selfish agents.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
An improved monotone algorithm for scheduling related machines with precedence constraints
Authors
,