Single machine scheduling problems with uncertain parameters and the OWA criterion

In this paper a class of single machine scheduling problems is discussed. It is assumed that job parameters, such as processing times, due dates, or weights are uncertain and their values are specified in the form of a discrete scenario set. The ordered weighted averaging (OWA) aggregation operator is used to choose an optimal schedule. The OWA operator generalizes traditional criteria used in decision making under uncertainty, such as the maximum, average, median, or Hurwicz criterion. It also allows us to extend the robust approach to scheduling by taking into account various attitudes of decision makers towards a risk. In this paper, a general framework for solving single machine scheduling problems with the OWA criterion is proposed and some positive and negative computational results for two basic single machine scheduling problems are provided.

[1]  Wlodzimierz Ogryczak,et al.  On solving linear programs with the ordered weighted averaging objective , 2003, Eur. J. Oper. Res..

[2]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[3]  Olivier Spanjaard,et al.  Exact algorithms for OWA-optimization in multiobjective spanning tree problems , 2009, Comput. Oper. Res..

[4]  C. N. Potts,et al.  An algorithm for the single machine sequencing problem with precedence constraints , 1980 .

[5]  Jian Yang,et al.  On the Robust Single Machine Scheduling Problem , 2002, J. Comb. Optim..

[6]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decision-making , 1988 .

[7]  Mohamed Ali Aloulou,et al.  Minimizing the number of late jobs on a single machine under due date uncertainty , 2011, J. Sched..

[8]  P. Zieliński,et al.  MINMAX (REGRET) SCHEDULING PROBLEMS , 2013 .

[9]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

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

[11]  Igor Averbakh,et al.  Complexity of minimizing the total flow time with interval data and minmax regret criterion , 2006, Discret. Appl. Math..

[12]  Madhav V. Marathe,et al.  On Approximation Algorithms for the Minimum Satisfiability Problem , 1996, Inf. Process. Lett..

[13]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[14]  Ola Svensson,et al.  Single machine scheduling with scenarios , 2013, Theor. Comput. Sci..

[15]  David Gale,et al.  Review: R. Duncan Luce and Howard Raiffa, Games and decisions: Introduction and critical survey , 1958 .

[16]  Didier Dubois,et al.  Computing improved optimal solutions to max-min flexible constraint satisfaction problems , 1999, Eur. J. Oper. Res..

[17]  S. Vajda,et al.  GAMES AND DECISIONS; INTRODUCTION AND CRITICAL SURVEY. , 1958 .

[18]  Adam Kasperski,et al.  Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters , 2011, IEEE Transactions on Fuzzy Systems.

[19]  Rajeev Kohli,et al.  The Minimum Satisfiability Problem , 1994, SIAM J. Discret. Math..

[20]  A. Volgenant,et al.  Improved polynomial algorithms for robust bottleneck problems with interval data , 2010, Comput. Oper. Res..

[21]  Igor Averbakh,et al.  On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..

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

[23]  Ming Zhao,et al.  A family of inequalities valid for the robust single machine scheduling polyhedron , 2010, Comput. Oper. Res..

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

[25]  Andreas S. Schulz.  Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds , 1996, IPCO.

[26]  Uri Zwick,et al.  Approximating MIN k-SAT , 2002, ISAAC.

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

[28]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[29]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[30]  Janusz Kacprzyk,et al.  Recent Developments in the Ordered Weighted Averaging Operators: Theory and Practice , 2011, Studies in Fuzziness and Soft Computing.

[31]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[32]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decisionmaking , 1988, IEEE Trans. Syst. Man Cybern..

[33]  Adam Kasperski.  Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion , 2005, Oper. Res. Lett..