Combinatorial Optimization and Applications

Volume 5165 of the series Lecture Notes in Computer Science pp 448-457

Stochastic Online Scheduling Revisited

  • Andreas S. SchulzAffiliated withSloan School of Management, Massachusetts Institute of Technology,  

* Final gross prices may vary according to local VAT.

Get Access


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.