Online Makespan Minimization with Budgeted Uncertainty

[1]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[2]  Gerhard J. Woeginger,et al.  An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling , 1993, SIAM J. Comput..

[3]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[4]  Thomas Erlebach,et al.  An Adversarial Model for Scheduling with Testing , 2017, Algorithmica.

[5]  Yuval Rabani,et al.  A Better Lower Bound for On-Line Scheduling , 1994, Inf. Process. Lett..

[6]  Martin Skutella,et al.  Online Scheduling with Bounded Migration , 2004, Math. Oper. Res..

[7]  Klaus Jansen,et al.  Approximation results for makespan minimization with budgeted uncertainty , 2019, WAOA.

[8]  Adam Kurpisz,et al.  Parallel Machine Scheduling under Uncertainty , 2012, IPMU.

[9]  Susanne Albers.  Better Bounds for Online Scheduling , 1999, SIAM J. Comput..

[10]  Federico Della Croce,et al.  Complexity of single machine scheduling problems under scenario-based uncertainty , 2008, Oper. Res. Lett..

[11]  Ola Svensson,et al.  Approximating Single Machine Scheduling with Scenarios , 2008, APPROX-RANDOM.

[12]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Rudolf Fleischer,et al.  On‐line scheduling revisited , 2000 .

[14]  Adam Kurpisz,et al.  Approximating a two-machine flow shop scheduling under discrete scenario uncertainty , 2012, Eur. J. Oper. Res..

[15]  Jonathan Cole Smith,et al.  Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems , 2015, J. Sched..

[16]  Michael Poss,et al.  Approximating Robust Bin Packing with Budgeted Uncertainty , 2019, WADS.

[17]  Lin Chen,et al.  Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming , 2015, Asia Pac. J. Oper. Res..

[18]  Thomas Erlebach,et al.  Query-competitive algorithms for cheapest set problems under uncertainty , 2014, Theor. Comput. Sci..

[19]  Michael Poss,et al.  Robust scheduling with budgeted uncertainty , 2019, Discret. Appl. Math..

[20]  David R. Karger,et al.  A better algorithm for an ancient scheduling problem , 1994, SODA '94.