Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategies

In this paper, flexible job shop scheduling problem with machine breakdown is of concern. Considering that there is a limitation in improving robust and stable performance of rescheduling with a single strategy, an approach with multi-strategies is proposed to make the scheduling more robust and stable. First, in prescheduling, a new idle time insertion strategy is put forward. In this new policy, idle time equal to repair time is inserted into an appropriate position of each machine according to the machine's breakdown nature. Second, route changing strategy combined with right-shift policy is proposed to keep the rescheduling as stable and robust as possible. In this policy, whether to right shift or route change is dependent on the cost of archiving robustness and stability. Based on the two strategies, new algorithms dealing with idle time insertion, right-shift scheduling, and route changing scheduling are designed. The computational results show the effectiveness of the new strategies and new algorithms compared with other strategies.

[1]  Mostafa Zandieh,et al.  Dynamic job shop scheduling using variable neighbourhood search , 2010 .

[2]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[3]  M. Zandieh,et al.  An efficient architecture for scheduling flexible job-shop with machine availability constraints , 2010 .

[4]  Yugeng Xi,et al.  A rolling horizon job shop rescheduling strategy in the dynamic environment , 1997 .

[5]  Tarek Y. ElMekkawy,et al.  Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm , 2011 .

[6]  Nasr Al-Hinai,et al.  An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem , 2011 .

[7]  Mostafa Zandieh,et al.  A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem , 2012 .

[8]  K.L. Poh,et al.  A Bayesian network approach to job-shop rescheduling , 2007, 2007 IEEE International Conference on Industrial Engineering and Engineering Management.

[9]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[10]  Haruhiko Suwa,et al.  Capability of cumulative delay based reactive scheduling for job shops with machine breakdowns , 2007, Comput. Ind. Eng..

[11]  Reha Uzsoy,et al.  Predictable scheduling of a job shop subject to breakdowns , 1998, IEEE Trans. Robotics Autom..

[12]  F. Fnaiech,et al.  New shifting method for job shop scheduling subject to invariant constraints of resources availability , 2009, 2009 35th Annual Conference of IEEE Industrial Electronics.

[13]  Chelliah Sriskandarajah,et al.  The complexity of scheduling jobs in repetitive manufacturing systems , 1993 .

[14]  Jianbo Yu,et al.  An effective heuristic for flexible job-shop scheduling problem with maintenance activities , 2010, Comput. Ind. Eng..

[15]  Qiqiang Li,et al.  An algorithm of job shop rolling scheduling based on singular rough sets , 2007 .

[16]  Elizabeth Szelke,et al.  Knowledge-based reactive scheduling , 1994 .

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

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

[19]  Dirk C. Mattfeld,et al.  Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling , 1996, Production and Logistics.

[20]  Pierre Borne,et al.  Evolution programs for job-shop scheduling , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[21]  Ruhul A. Sarker,et al.  Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns , 2011 .

[22]  Velusamy Subramaniam,et al.  mAOR: A heuristic-based reactive repair mechanism for job shop schedules , 2003 .

[23]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[24]  Frank DiCesare,et al.  Scheduling flexible manufacturing systems using Petri nets and heuristic search , 1994, IEEE Trans. Robotics Autom..

[25]  Saeed Mansour,et al.  Dynamic flexible job shop scheduling with alternative process plans: an agent-based approach , 2011 .

[26]  P. Brunn,et al.  Workshop scheduling using practical (inaccurate) data Part 2: An investigation of the robustness of scheduling rules in a dynamic and stochastic environment , 1999 .

[27]  Deming Lei,et al.  Scheduling stochastic job shop subject to random breakdown to minimize makespan , 2011 .

[28]  Jinbao Li,et al.  An Efficient Clustering-Based Method for Data Gathering and Compressing in Sensor Networks , 2007 .

[29]  Ramón Alvarez-Valdés,et al.  A heuristic to schedule flexible job-shop in a glass factory , 2005, Eur. J. Oper. Res..

[30]  Mikkel T. Jensen,et al.  Robust and Flexible Scheduling with Evolutionary Computation , 2001 .

[31]  Reha Uzsoy,et al.  Predictable scheduling of a single machine with breakdowns and sensitive jobs , 1999 .

[32]  Oliver Holthaus,et al.  Scheduling in job shops with machine breakdowns: an experimental study , 1999 .

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

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

[35]  Ihsan Sabuncuoglu,et al.  Routing-based reactive scheduling policies for machine failures in dynamic job shops , 2001 .