253 search results - page 4 / 51 » Approximation algorithm for the temperature-aware scheduling... |
84
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
LATIN
2000
Springer
15 years 1 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
AAAI
2007
14 years 12 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
ECCC
2000
14 years 9 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
195
click to vote
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...