Stochastic Online Scheduling Revisited
- Cite this paper as:
- Schulz A.S. (2008) Stochastic Online Scheduling Revisited. In: Yang B., Du DZ., Wang C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg
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 randomized as well as deterministic online and off-line algorithms that have the best known performance guarantees in either setting, deterministic and off-line or randomized and online. Our analysis is based on a novel linear programming relaxation for stochastic scheduling problems, which can be solved online.
Unable to display preview. Download preview PDF.