8 search results - page 1 / 2 » Fast Monotone 3-Approximation Algorithm for Scheduling Relat... |
ESA
2005
Springer
13 years 11 months ago
2005
Springer
ORL
2008
13 years 5 months ago
2008
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
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...
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...
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...