Sciweavers

24 search results - page 1 / 5
» Randomized Approximation Schemes for Scheduling Unrelated Pa...
Sort
View
86
Voted
ECCC
2000
140views more  ECCC 2000»
14 years 10 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
SIAMDM
2002
124views more  SIAMDM 2002»
14 years 9 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
110
Voted
LATIN
2010
Springer
15 years 2 days ago
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
Eric Angel, Evripidis Bampis, Nicolas Thibault
53
Voted
INFORMS
2002
60views more  INFORMS 2002»
14 years 9 months ago
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
Tjark Vredeveld, Cor A. J. Hurkens