33 search results - page 6 / 7 » Preemptive Scheduling on Selfish Machines |
STOC
1996
ACM
13 years 11 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
JCO
2006
13 years 7 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...
TC
2002
13 years 7 months ago
2002
The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be...
SODA
1997
ACM
13 years 8 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
After having drawn up a state of the art on the theoretical feasibility of a system of periodic tasks scheduled by a preemptive algorithm at fixed priorities, we show in this art...