11 search results - page 1 / 3 » A deterministic truthful PTAS for scheduling related machine... |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
STACS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
CAAN
2007
Springer
13 years 9 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...