Stochastic Online Scheduling Revisited

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 offline or randomized and online. Our analysis is based on a novel linear programming relaxation for stochastic scheduling problems, which can be solved online.

• Type: Conference
• Year: 2008
• Where: COCOA
• Authors: Andreas S. Schulz
• Keywords: COCOA 2008, Discrete Geometry, Identical Parallel Machines, Stochastic Processing Times, Total Weighted Completion