Service-oriented robust parallel machine scheduling

Stochastic scheduling optimisation is a hot and challenging research topic with wide applications. Most existing works on stochastic parallel machine scheduling address uncertain processing time, and assume that its probability distribution is known or can be correctly estimated. This paper investigates a stochastic parallel machine scheduling problem, and assumes that only the mean and covariance matrix of the processing times are known, due to the lack of historical data. The objective is to maximise the service level, which measures the probability of all jobs jointly completed before or at their due dates. For the problem, a new distributionally robust formulation is proposed, and two model-based approaches are developed: (1) a sample average approximation method is adapted, (2) a hierarchical approach based on mixed integer second-order cone programming (MI-SOCP) formulation is designed. To evaluate and compare the performance of the two approaches, randomly generated instances are tested. Computational results show that our proposed MI-SOCP-based hierarchical approach can obtain higher solution quality with less computational effect.

[1]  Savas Balin,et al.  Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation , 2011, Information Sciences.

[2]  Willy Herroelen,et al.  Project scheduling under uncertainty: Survey and research potentials , 2005, Eur. J. Oper. Res..

[3]  Kai Wang,et al.  An estimation of distribution algorithm for hybrid flow shop scheduling under stochastic processing times , 2014 .

[4]  Baoding Liu,et al.  Parallel machine scheduling models with fuzzy processing times , 2004, Inf. Sci..

[5]  C. Chu,et al.  An improved exact algorithm for single-machine scheduling to minimise the number of tardy jobs with periodic maintenance , 2016 .

[6]  Joseph Y.-T. Leung,et al.  Parallel machine scheduling with nested processing set restrictions , 2010, Eur. J. Oper. Res..

[7]  Cerry M. Klein,et al.  Minimizing the expected number of tardy jobs when processing times are normally distributed , 2002, Oper. Res. Lett..

[8]  Siqian Shen,et al.  Solving 0–1 semidefinite programs for distributionally robust allocation of surgery blocks , 2018, Optim. Lett..

[9]  G. Calafiore,et al.  On Distributionally Robust Chance-Constrained Linear Programs , 2006 .

[10]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[11]  Bertrand M. T. Lin,et al.  Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs , 2004 .

[12]  Wen-Jinn Chen,et al.  Minimizing number of tardy jobs on a single machine subject to periodic maintenance , 2009 .

[13]  Michael R. Wagner.  Stochastic 0-1 linear programming under limited distributional information , 2008, Oper. Res. Lett..

[14]  Xian Zhou,et al.  Single-Machine Scheduling with Exponential Processing Times and General Stochastic Cost Functions , 2005, J. Glob. Optim..

[15]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..

[16]  Palle Thoft-Christensen,et al.  Application of Structural Systems Reliability Theory , 1986 .

[17]  Alexander Shapiro,et al.  Convex Approximations of Chance Constrained Programs , 2006, SIAM J. Optim..

[18]  W. Y. Szeto,et al.  A Distributionally Robust Joint Chance Constrained Optimization Model for the Dynamic Network Design Problem under Demand Uncertainty , 2014, Networks and Spatial Economics.

[19]  Raymond Chiong,et al.  Robust single machine scheduling with uncertain release times for minimising the maximum waiting time , 2018, Int. J. Prod. Res..

[20]  Donya Rahmani,et al.  Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times , 2014 .

[21]  Feifeng Zheng,et al.  Towards robustness of response times: minimising the maximum inter-completion time on parallel machines , 2019 .

[22]  Dan Trietsch,et al.  Stochastic scheduling with optimal customer service , 2001, J. Oper. Res. Soc..

[23]  Daniel Ralph,et al.  Convergence of Stationary Points of Sample Average Two-Stage Stochastic Programs: A Generalized Equation Approach , 2011, Math. Oper. Res..

[24]  Ali Allahverdi,et al.  Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times , 2017 .

[25]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms and Systems Development , 1992 .

[26]  Kai Huang,et al.  Chance Constrained Optimization for Targeted Internet Advertising , 2014, ArXiv.

[27]  Jun Lin,et al.  Hedge against total flow time uncertainty of the uniform parallel machine scheduling problem with interval data , 2014 .

[28]  Ruiwei Jiang,et al.  Data-driven chance constrained stochastic program , 2015, Mathematical Programming.

[29]  Vishal Gupta,et al.  Robust sample average approximation , 2014, Math. Program..

[30]  Ryuhei Miyashiro,et al.  Mixed integer second-order cone programming formulations for variable selection in linear regression , 2015, Eur. J. Oper. Res..

[31]  H. M. Soroush,et al.  Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem , 2007, Eur. J. Oper. Res..

[32]  Wei-Chang Yeh,et al.  Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects , 2014, Inf. Sci..

[33]  Siqian Shen,et al.  Distributionally robust appointment scheduling with moment-based ambiguity set , 2017, Oper. Res. Lett..

[34]  J. Kiefer,et al.  Sequential minimax search for a maximum , 1953 .

[35]  Yinyu Ye,et al.  Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems , 2010, Oper. Res..

[36]  Anja De Waegenaere,et al.  Robust Solutions of Optimization Problems Affected by Uncertain Probabilities , 2011, Manag. Sci..

[37]  Daniel Kuhn,et al.  Distributionally robust joint chance constraints with second-order moment information , 2011, Mathematical Programming.

[38]  Johnny C. Ho,et al.  Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs , 2007, Eur. J. Oper. Res..

[39]  Jean-Philippe Vial,et al.  Robust Optimization , 2021, ICORES.

[40]  Tao Yao,et al.  Dynamic Traffic Assignment under Uncertainty: A Distributional Robust Chance-Constrained Approach , 2011 .

[41]  Bernardo K. Pagnoncelli,et al.  Chance-constrained problems and rare events: an importance sampling approach , 2016, Math. Program..

[42]  Alexander Shapiro,et al.  Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications , 2009, J. Optimization Theory and Applications.

[43]  Melvyn Sim,et al.  From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization , 2010, Oper. Res..

[44]  Paul Tseng,et al.  Second-Order Cone Programming Relaxation of Sensor Network Localization , 2007, SIAM J. Optim..

[45]  Donald Goldfarb,et al.  Second-order cone programming , 2003, Math. Program..

[46]  Sanja Petrovic,et al.  Sensitivity analysis of a fuzzy multiobjective scheduling problem , 2008 .

[47]  Sameer Sharma,et al.  Bi-objective scheduling on parallel machines with uncertainprocessing time , 2012 .

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

[49]  Wei Wang,et al.  Sample average approximation of expected value constrained stochastic programs , 2008, Oper. Res. Lett..

[50]  Martin Branda,et al.  Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints , 2012, Oper. Res. Lett..

[51]  Giuseppe Carlo Calafiore,et al.  Distributionally Robust Chance-Constrained Linear Programs with Applications , 2006 .

[52]  Cécile Murat,et al.  Recent advances in robust optimization: An overview , 2014, Eur. J. Oper. Res..

[53]  R. M’Hallah,et al.  A Benders decomposition approach to the weighted number of tardy jobs scheduling problem on unrelated parallel machines with production costs , 2015 .

[54]  Subhash C. Sarin,et al.  Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines , 1989 .

[55]  Xiaoqing Xu,et al.  Robust makespan minimisation in identical parallel machine scheduling problem with interval data , 2013 .