Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

CORR
2010
Springer

favoriteEmaildiscussreport

133views Education» more CORR 2010»

Santa Claus Schedules Jobs on Unrelated Machines

13 years 4 months ago

Santa Claus Schedules Jobs on Unrelated Machines

Download www.csc.kth.se

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

Real-time Traffic

2-approximation Algorithm | CORR 2010 | Education | Theory | Unrelated Machines |

claim paper

Related Content

» A General Framework for Designing Approximation Schemes for Combinatorial Optimization Pro...

» Scheduling Unrelated Machines by Randomized Rounding

» Preemptive Scheduling with Rejection

» Sizereduction heuristics for the unrelated parallel machines scheduling problem

» Convex programming for scheduling unrelated parallel machines

» The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

» Energy Efficient Scheduling via Partial Shutdown

» Optimal solutions for unrelated parallel machines scheduling problems using convex quadrat...

» Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Ola Svensson

Comments (0)