155 search results - page 9 / 31 » Online Scheduling of Equal-Length Jobs on Parallel Machines |
MFCS
1994
Springer
13 years 12 months ago
1994
Springer
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
EOR
2008
13 years 8 months ago
2008
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
SIAMCOMP
2010
13 years 2 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...