1125 search results - page 11 / 225 » On the job rotation problem |
141
click to vote
ESA
2000
Springer
15 years 5 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...
106
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...