33 search results - page 2 / 7 » Preemptive Scheduling on Selfish Machines |
STACS
2004
Springer
13 years 11 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 ...
EOR
2007
13 years 6 months ago
2007
CORR
2004
Springer
13 years 6 months ago
2004
Springer
LATIN
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
MICS
2010
13 years 4 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...