Santa Claus Schedules Jobs on Unrelated Machines

One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated machines, i.e., job j requires time pij if processed on machine i. More than two decades after

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Ola Svensson
• Keywords: 2-approximation Algorithm, CORR 2010, Education, Theory, Unrelated Machines