21 search results - page 2 / 5 » Optimal and Online Preemptive Scheduling on Uniformly Relate... |
ESA
2000
Springer
13 years 9 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
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...
EOR
2007
13 years 5 months ago
2007
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...
JCO
2006
13 years 5 months ago
2006
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...