New robust single machine scheduling to hedge against processing time uncertainty

This paper focuses on the single machine scheduling problem with uncertain processing times described via a set of scenarios. Rather than the traditional worst-case model, a new robust model is proposed based on two-bad-scenario set and the new problem is proved NP-complete. The proposed solution method is based on a branch-and-bound algorithm, in which a pruning rule and a method to get the upper bound and lower bound values are designed. The extensive computational results demonstrate the effectiveness of the branch-and-bound algorithm and the advantages of the new model.

[1]  Vinícius Amaral Armentano,et al.  Robust optimization models for project scheduling with resource availability cost , 2007, J. Sched..

[2]  R. L. Daniels,et al.  β-Robust scheduling for single-machine systems with uncertain processing times , 1997 .

[3]  Daniel Vanderpooten,et al.  Complexity of the min-max and min-max regret assignment problems , 2005, Oper. Res. Lett..

[4]  大山 達雄 Theory of Scheduling, C. L. Liu , 1979 .

[5]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[6]  Ihsan Sabuncuoglu,et al.  Optimization of schedule robustness and stability under random machine breakdowns and processing time variability , 2009 .

[7]  Chengbin Chu,et al.  Robust optimization for the cyclic hoist scheduling problem , 2015, Eur. J. Oper. Res..

[8]  Kenneth N. Brown,et al.  Scheduling with uncertain durations: Modeling beta-robust scheduling with constraints , 2009, Comput. Oper. Res..

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

[10]  Fred Glover,et al.  Surrogate Constraint Duality in Mathematical Programming , 1975, Oper. Res..

[11]  Chung-Cheng Lu,et al.  Robust scheduling on a single machine to minimize total flow time , 2012, Comput. Oper. Res..

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

[13]  Chung-Cheng Lu,et al.  Robust single machine scheduling for minimizing total flow time in the presence of uncertain processing times , 2014, Comput. Ind. Eng..

[14]  Bing Wang,et al.  Bad-scenario Set Based Risk-resisting Robust Scheduling Model: Bad-scenario Set Based Risk-resisting Robust Scheduling Model , 2012 .

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

[16]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .