Sciweavers

Share
CORR
2010
Springer

Santa Claus Schedules Jobs on Unrelated Machines

11 years 12 months ago
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
Ola Svensson
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CORR
Authors Ola Svensson
Comments (0)
books