Minimizing worst-case and average-case makespan over scenarios

We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all scenarios in an explicitly given set. Each scenario is a subset of jobs that must be executed in that scenario. The two objectives that we consider are minimizing the maximum makespan over all scenarios and minimizing the sum of the makespans of all scenarios. For both versions, we give several approximation algorithms and lower bounds on their approximability. We also consider some (easier) special cases. Combinatorial optimization problems under scenarios in general, and scheduling problems under scenarios in particular, have seen only limited research attention so far. With this paper, we make a step in this interesting research direction.

[1]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[2]  Adam Kasperski,et al.  Single machine scheduling problems with uncertain parameters and the OWA criterion , 2014, Journal of Scheduling.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Uri Zwick,et al.  Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.

[5]  Ryan O'Donnell,et al.  Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..

[6]  Christodoulos A. Floudas,et al.  A new robust optimization approach for scheduling under uncertainty: : I. Bounded uncertainty , 2004, Comput. Chem. Eng..

[7]  Gianpaolo Oriolo,et al.  Network design with a discrete set of traffic matrices , 2013, Oper. Res. Lett..

[8]  Patrick Jaillet,et al.  Probabilistic Traveling Salesman Problems , 1985 .

[9]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

[10]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[11]  Jiawei Zhang,et al.  Improved approximations for max set splitting and max NAE SAT , 2004, Discret. Appl. Math..

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

[13]  Leah Epstein,et al.  Multidimensional Packing Problems , 2018, Handbook of Approximation Algorithms and Metaheuristics.

[14]  Nicole Megow,et al.  Universal Sequencing on an Unreliable Machine , 2012, Encyclopedia of Algorithms.

[15]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[16]  Venkatesan Guruswami,et al.  (2+ε)-Sat Is NP-hard , 2014, SIAM J. Comput..

[17]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Antonio Alonso Ayuso,et al.  Introduction to Stochastic Programming , 2009 .

[19]  Adam Kurpisz,et al.  Approximating the min-max (regret) selecting items problem , 2013, Inf. Process. Lett..

[20]  Venkatesan Guruswami,et al.  (2 + epsilon)-Sat Is NP-Hard , 2014, FOCS.

[21]  Lin Chen,et al.  Stochastic and Robust Scheduling in the Cloud , 2015, APPROX-RANDOM.

[22]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[23]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[24]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[25]  Arkadi Nemirovski,et al.  Robust optimization – methodology and applications , 2002, Math. Program..

[26]  Felix T. S. Chan,et al.  A Robust Replenishment and Production Control Policy for a Single-Stage Production/Inventory System with Inventory Inaccuracy , 2015, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[27]  R. Ravi,et al.  Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems , 2011, SIAM J. Comput..

[28]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.