Rescheduling flowshops under simultaneous disruptions

Production planning and scheduling systems are pervasive in manufacturing systems to increase productivity, variety and customization without incurring in high costs. A large number of impromptu disruptions frequently affect the scheduled operations and invalidate the original schedules. Rescheduling actions have to be triggered in order to reduce the impact on the performance of the system. A large body of research covering miscellaneous problem characteristics can be found in the scheduling literature. Even so, the application of scheduling techniques is still infrequent in real-life scheduling problems. In this work we generate eight types of disruptions that affect the original schedules simultaneously. We apply three rescheduling methods and compare their results with simple rule based repair actions typically employed in production environments. Statistical analysis is used to demonstrate that the proposed methods outperform the rule based approaches by a significant margin, highlighting their effectiveness in real life manufacturing settings.

[1]  A. G. Lockett,et al.  Job shop scheduling heuristics and frequency of scheduling , 1982 .

[2]  Reha Uzsoy,et al.  Analysis of periodic and event-driven rescheduling policies in dynamic shops , 1992 .

[3]  Chandrasekharan Rajendran,et al.  Scheduling in flowshops to minimize total tardiness of jobs , 2004 .

[4]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[5]  Mostafa Zandieh,et al.  An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns , 2009 .

[6]  William G. Ferrell,et al.  Dynamic rescheduling that simultaneously considers efficiency and stability , 2004, Comput. Ind. Eng..

[7]  Amritpal Singh Raheja,et al.  Reactive repair tool for job shop schedules , 2005 .

[8]  Antonio Grieco,et al.  An online approach to dynamic rescheduling for production planning applications , 2008 .

[9]  Sanja Petrovic,et al.  SURVEY OF DYNAMIC SCHEDULING IN MANUFACTURING SYSTEMS , 2006 .

[10]  Chris N. Potts,et al.  Rescheduling for New Orders , 2004, Oper. Res..

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

[12]  M Özlen,et al.  Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria , 2011, J. Oper. Res. Soc..

[13]  Ghaith Rabadi,et al.  Rescheduling of unrelated parallel machines under machine breakdowns , 2008 .

[14]  Jeffrey W. Herrmann,et al.  Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods , 2003, J. Sched..

[15]  James C. Bean,et al.  Matchup Scheduling with Multiple Resources, Release Dates and Disruptions , 1991, Oper. Res..

[16]  Rubén Ruiz,et al.  Flow shop rescheduling under different types of disruption , 2013 .

[17]  Sanjay Mehta,et al.  Predictable scheduling of a single machine subject to breakdowns , 1999, Int. J. Comput. Integr. Manuf..

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

[19]  Xiangtong Qi,et al.  Disruption management for machine scheduling: The case of SPT schedules , 2006 .

[20]  Rubén Ruiz,et al.  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..

[21]  F. Robert Jacobs,et al.  Manufacturing Planning and Control for Supply Chain Management, 6/E. , 2016 .

[22]  Botond Kádár,et al.  Stability-oriented evaluation of rescheduling strategies, by using simulation , 2007, Comput. Ind..

[23]  Ali Allahverdi,et al.  Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness , 1996, Comput. Oper. Res..

[24]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[25]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[26]  Ihsan Sabuncuoglu,et al.  Reactive scheduling in a dynamic and stochastic FMS environment , 2003 .

[27]  M. Selim Akturk,et al.  Match-up scheduling under a machine breakdown , 1999, Eur. J. Oper. Res..

[28]  Elisabet Capón-García,et al.  Costs for rescheduling actions: a critical issue for reducing the gap between scheduling theory and practice , 2008 .