An improved monotone algorithm for scheduling related machines with precedence constraints

► 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.