5 search results - page 1 / 1 » Minimizing Makespan and Preemption Costs on a System of Unif... |
ALGORITHMICA
2005
13 years 4 months ago
2005
CAAN
2007
Springer
13 years 8 months ago
2007
Springer
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
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 ...
DAGSTUHL
2007
13 years 6 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...