Stochastic Online Scheduling Revisited

  • Andreas S. Schulz
Conference paper

DOI: 10.1007/978-3-540-85097-7_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5165)
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.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Andreas S. Schulz
    • 1
  1. 1.Sloan School of Management, Massachusetts Institute of Technology CambridgeUSA

Personalised recommendations