Analysis of robustness in proactive scheduling: A graphical approach

Scheduling environments are generally disturbed by different types of unforeseen events, such as machine breakdowns, unavailability of tools, and arrival of urgent orders. To maintain good performances when these perturbations occur, a schedule has to be robust. These last years, robustness has become an essential issue for scheduling problems. In the related literature, the robustness of schedules is generally evaluated in a quantitative manner, using different possible measures which usually quantify the capacity of a schedule to remain efficient in unexpected conditions. In this article, robustness is addressed from a more qualitative viewpoint. Flowshop scheduling problems are emphasized upon. Instead of evaluating scheduling using a measure, two graphical representations of scheduling solutions are proposed. They provide assistance to the decision maker in understanding the consequences of possible perturbations, so that a suited decision about which solution to choose can be made. The first type of plot shows the extent to which disruptions can be admitted without any consequences on the performance criterion. It also allows the identification of critical periods, where no disruption can be admitted. The second type of plot aims at representing the consequences of disruptions, of different possible length with different possible occurrences, on the performance. An example, comparing two candidate solutions, of a flowshop problem, illustrates the benefits of this approach, which is complementary from a quantitative analysis, based on common robustness measures.

[1]  Kenneth Sörensen,et al.  A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates , 2004, 4OR.

[2]  Ihsan Sabuncuoglu,et al.  Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research , 2009, Int. J. Comput. Integr. Manuf..

[3]  Erik Demeulemeester,et al.  Proactive heuristic procedures for robust project scheduling: An experimental analysis , 2008, Eur. J. Oper. Res..

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

[5]  Henri Pierreval,et al.  Robust simulation with a base environmental scenario , 2007, Eur. J. Oper. Res..

[6]  Bo Guo,et al.  Rescheduling and optimization of schedules considering machine failures , 1999 .

[7]  Gintaras V. Reklaitis,et al.  A framework for investigating schedule robustness under uncertainty , 1995 .

[8]  Ihsan Sabuncuoglu,et al.  Analysis of reactive scheduling problems in a job shop environment , 2000, Eur. J. Oper. Res..

[9]  Gang Yu,et al.  Single machine scheduling under potential disruption , 2007, Oper. Res. Lett..

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

[11]  Chun-Yi Kuo,et al.  RELATIVE ROBUSTNESS FOR SINGLE-MACHINE SCHEDULING PROBLEM WITH PROCESSING TIME UNCERTAINTY , 2002 .

[12]  Ihsan Sabuncuoglu,et al.  Robustness and stability measures for scheduling: single-machine environment , 2008 .

[13]  Mikkel T. Jensen,et al.  Generating robust and flexible job shop schedules using genetic algorithms , 2003, IEEE Trans. Evol. Comput..

[14]  Jean-Charles Billaut,et al.  Maximization of solution flexibility for robust shop scheduling , 2005, Eur. J. Oper. Res..

[15]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

[16]  Reha Uzsoy,et al.  Executing production schedules in the face of uncertainties: A review and some future directions , 2005, Eur. J. Oper. Res..

[17]  Gintaras V. Reklaitis,et al.  Robust scheduling with processing time uncertainty , 1997 .

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

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

[20]  Mikkel T. Jensen,et al.  Improving robustness and flexibility of tardiness and total flow-time job shops using robustness measures , 2001, Appl. Soft Comput..

[21]  Mohamed Haouari,et al.  A bi-objective model for robust resource-constrained project scheduling , 2005 .