Stochastic online scheduling

In this paper we consider a model for scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Jobs arrive in an online manner and as soon as a job becomes known, the scheduler only learns about the probability distribution of the processing time and not the actual processing time. This model is called the stochastic online scheduling (SOS) model. Both online scheduling and stochastic scheduling are special cases of this model. In this paper, we survey the results for the SOS model.

[1]  Michael Pinedo.  Offline Deterministic Scheduling, Stochastic Scheduling, and Online Deterministic Scheduling , 2004, Handbook of Scheduling.

[2]  Andreas S. Schulz.  Stochastic Online Scheduling Revisited , 2008, COCOA.

[3]  Anja Feldmann,et al.  Optimal online scheduling of parallel jobs with dependencies , 1993, STOC.

[4]  Alan G. Konheim,et al.  A note on time-sharing , 1968 .

[5]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[6]  Michael H. Rothkopf.  Scheduling with Random Service Times , 1966 .

[7]  Gang Chen,et al.  Probabilistic asymptotic analysis of stochastic online scheduling problems , 2007 .

[8]  Nicole Megow,et al.  On-line scheduling to minimize average completion time revisited , 2004, Oper. Res. Lett..

[9]  Alan G. Konheim.  A note on time sharing with preferred customers , 1968 .

[10]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[11]  Martin Skutella,et al.  Single Machine Scheduling with Release Dates , 2002, SIAM J. Discret. Math..

[12]  S. Muthukrishnan,et al.  Resource scheduling for parallel database and scientific applications , 1996, SPAA '96.

[13]  Brian C. Dean,et al.  Approximation algorithms for stochastic scheduling problems , 2005 .

[14]  Nicole Megow,et al.  Models and Algorithms for Stochastic Online Scheduling , 2006, Math. Oper. Res..

[15]  Hui Liu,et al.  On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions , 2006, Oper. Res..

[16]  Nicole Megow,et al.  Approximation in Preemptive Stochastic Online Scheduling , 2006, ESA.

[17]  José R. Correa,et al.  LP-based online scheduling: from single to parallel machines , 2005, Math. Program..

[18]  G. Weiss,et al.  On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines , 1995, Advances in Applied Probability.

[19]  J. Sousa,et al.  Time Indexed Formulations Of Non-Preemptive Single-Machine Schduling Problems , 1989 .

[20]  Kirk Pruhs,et al.  Online scheduling , 2003 .

[21]  J. Gittins.  Bandit processes and dynamic allocation indices , 1979 .

[22]  Peter Brucker.  Scheduling algorithms (4. ed.) , 2004 .

[23]  Anja Feldmann,et al.  Optimal On-Line Scheduling of Parallel Jobs with Dependencies , 1998, J. Comb. Optim..

[24]  J. Bather,et al.  Multi‐Armed Bandit Allocation Indices , 1990 .

[25]  Philip N. Klein,et al.  Approximation algorithms for NP-hard optimization problems , 2010 .

[26]  Zhi-Long Chen,et al.  Algorithms for deterministic and stochastic scheduling , 1997 .

[27]  Thomas Erlebach,et al.  Scheduling AND/OR-Networks on Identical Parallel Machines , 2003, WAOA.

[28]  Nicole Megow,et al.  Stochastic Online Scheduling with Precedence Constraints , 2009 .

[29]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[30]  Michel X. Goemans,et al.  Improved approximation algorthims for scheduling with release dates , 1997, SODA '97.

[31]  Gideon Weiss,et al.  Stochastic scheduling problems I — General strategies , 1984, Z. Oper. Research.

[32]  Rajeev Motwani,et al.  Profile-driven instruction level parallel scheduling with application to super blocks , 1996, Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture. MICRO 29.

[33]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[34]  Mathematik Und,et al.  SCHEDULING AND/OR-NETWORKS ON IDENTICAL PARALLEL MACHINES , 2003 .

[35]  Kenneth C. Sevcik,et al.  Scheduling for Minimum Total Loss Using Service Time Distributions , 1974, JACM.

[36]  Rolf H. Möhring,et al.  Approximation in stochastic scheduling: the power of LP-based priority policies , 1999, JACM.