239 search results - page 5 / 48 » On-line scheduling of parallel jobs on two machines |
ESA
2000
Springer
13 years 11 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...
CCGRID
2002
IEEE
14 years 26 days ago
2002
IEEE
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...
ESA
2007
Springer
14 years 2 months ago
2007
Springer
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio de
ANOR
2008
13 years 8 months ago
2008
: In this paper, a new predictive-reactive approach to a parallel machine scheduling problem in the presence of uncertain disruptions is presented. The approach developed is based ...
ESA
2001
Springer
14 years 12 days ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...