34 search results - page 1 / 7 » Stochastic Online Scheduling Revisited |
COCOA
2008
Springer
13 years 6 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...
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 ...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Anticipatory algorithms for online stochastic optimization have been shown very effective in a variety of areas, including logistics, reservation systems, and scheduling. For such ...
ESA
2006
Springer
13 years 8 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 ...
OR
2007
Springer
13 years 11 months ago
2007
Springer
version of this extended abstract is published as [6].