1125 search results - page 11 / 225 » On the job rotation problem |
PUK
2000
13 years 10 months ago
2000
AMC
2005
13 years 8 months ago
2005
IJIIP
2010
13 years 5 months ago
2010
ESA
2000
Springer
14 years 5 days 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...
SPAA
2003
ACM
14 years 1 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...