Integrating rush orders into existent schedules for a complex job shop problem

This paper investigates the problem of inserting new rush orders into a current schedule of a real world job shop floor. Effective rescheduling methods must achieve reasonable levels of performance, measured according to a certain cost function, while preserving the stability of the shop floor, i.e. introducing as few changes as possible to the current schedule. This paper proposes new and effective match-up strategies which modify only a part of the schedule in order to accommodate the arriving jobs. The proposed strategies are compared with other rescheduling methods such as “right shift” and “insertion in the end”, which are optimal with respect to stability but poor with respect to performance, and with “total rescheduling” which is optimal with respect to performance but poor with respect to stability. Our results and statistical analysis reveal that the match-up strategies are comparable to the “right shift” and “insertion in the end” with respect to stability and as good as “total rescheduling” with respect to performance.

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

[2]  Sanja Petrovic,et al.  Fuzzy Logic-Based Production Scheduling and Rescheduling in the Presence of Uncertainty , 2011 .

[3]  Heng Li,et al.  A production rescheduling expert simulation system , 2000, Eur. J. Oper. Res..

[4]  Peter Cowling,et al.  Production, Manufacturing and Logistics Using real time information for effective dynamic scheduling , 2002 .

[5]  Jean-Marie Proth,et al.  Insertion of a random task in a schedule: a real-time approach , 2001, ETFA 2001. 8th International Conference on Emerging Technologies and Factory Automation. Proceedings (Cat. No.01TH8597).

[6]  John R. Birge,et al.  Optimality conditions for match-up strategies in stochastic scheduling , 1992 .

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

[8]  Stephen F. Smith,et al.  OPIS: an opportunistic factory scheduling system , 1990, IEA/AIE '90.

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

[10]  W. J. Chen,et al.  Scheduling under machine breakdown in a continuous process industry , 2004, Comput. Oper. Res..

[11]  James C. Bean,et al.  Match-up real-time scheduling , 1985 .

[12]  J. Sun,et al.  A dynamic reactive scheduling mechanism for responding to changes of production orders and manufacturing resources , 2001, Comput. Ind..

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

[14]  Luis Enrique Sucar,et al.  Temporal Bayesian Network of Events for Diagnosis and Prediction in Dynamic Domains , 2005, Applied Intelligence.

[15]  Fred W. Glover,et al.  Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times , 1993, Applied Intelligence.

[16]  Florin Gheorghe Filip,et al.  Job shop scheduling optimization in real-time production control , 1983 .

[17]  Stephen F. Smith,et al.  Reactive Scheduling Systems , 1995 .

[18]  Peter J. Ramadge,et al.  On real-time scheduling policies for flexible manufacturing systems , 1992 .

[19]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..

[20]  J. Christopher Beck,et al.  Slack-based Techniques for Robust Schedules , 2014 .

[21]  Sanja Petrovic,et al.  Fuzzy job shop scheduling with lot-sizing , 2008, Ann. Oper. Res..

[22]  Norman Sadeh,et al.  MICRO-OPPORTUNISTIC SCHEDULING THE MICRO-BOSS FACTORY SCHEDULER , 1994 .

[23]  Frederick Y. Wu,et al.  An Agent-Based Approach for Scheduling Multiple Machines , 2001, Applied Intelligence.

[24]  S. J. Mason,et al.  Rescheduling strategies for minimizing total weighted tardiness in complex job shops , 2004 .

[25]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

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

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

[28]  Robert J. Graves,et al.  Flexible assembly systems: an approach for near real-time scheduling and routeing of multiple products , 1988 .

[29]  Botond Kádár,et al.  Stability-oriented evaluation of hybrid rescheduling methods in a job-shop with machine breakdowns , 2006 .

[30]  J. A. Svestka,et al.  Rescheduling job shops under random disruptions , 1997 .

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

[32]  John R. Birge,et al.  Optimal Match-up Strategies in Stochastic Scheduling , 1995, Discret. Appl. Math..