An approximation algorithm for scheduling on three dedicated machines Original Research Article

We consider the scheduling problem of minimizing the makespan on three dedicated machines. We present a 76-approximation algorithm, improving the previously best performance guarantee of 54.