11 search results - page 2 / 3 » Scheduling Unrelated Machines by Randomized Rounding |
LATIN
2010
Springer
13 years 6 months ago
2010
Springer
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...
MP
2007
13 years 4 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
ICCSA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...