57 search results - page 1 / 12 » Stochastic Online Scheduling on Parallel Machines |
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
COCOA
2008
Springer
13 years 7 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
ESA
2006
Springer
13 years 9 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 ...
ESA
2007
Springer
13 years 11 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
WAOA
2010
Springer
13 years 3 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...