An effective heuristic for flexible job-shop scheduling problem with maintenance activities

Most production scheduling problems, including the standard flexible job-shop scheduling problem (FJSP), assume that machines are continuously available. However, in most realistic situations, machines may become unavailable during certain periods due to preventive maintenance (PM). In this paper, a flexible job-shop scheduling problem with machine availability constraints is considered. Each machine is subject to preventive maintenance during the planning period and the starting times of maintenance activities are either flexible in a time window or fixed beforehand. Moreover, two cases of maintenance resource constraint are considered: sufficient maintenance resource available or only one maintenance resource available. To deal with this variant FJSP problem with maintenance activities, a filtered beam search (FBS) based heuristic algorithm is proposed. With a modified branching scheme, the machine availability constraint and maintenance resource constraint can be easily incorporated into the proposed algorithm. Simulation experiments are conducted on some representative problems. The results demonstrate that the proposed filtered beam search based heuristic algorithm is a viable and effective approach for the FJSP with maintenance activities.

[1]  Joachim Breit,et al.  A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint , 2006, Comput. Oper. Res..

[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]  Chou-Jung Hsu,et al.  A two-machine flowshop scheduling problem with a separated maintenance constraint , 2008, Comput. Oper. Res..

[4]  Jean-Charles Billaut,et al.  New Single Machine and Job-Shop Scheduling Problems with Availability Constraints , 2005, J. Sched..

[5]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

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

[7]  Xi Lifeng,et al.  A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem , 2008 .

[8]  Lu-Wen Liao,et al.  Parallel machine scheduling with machine availability and eligibility constraints , 2008, Eur. J. Oper. Res..

[9]  Hongzhou Wang,et al.  A survey of maintenance policies of deteriorating systems , 2002, Eur. J. Oper. Res..

[10]  Rubén Ruiz,et al.  Considering scheduling and preventive maintenance in the flowshop sequencing problem , 2007, Comput. Oper. Res..

[11]  Wen-Jinn Chen,et al.  Minimizing number of tardy jobs on a single machine subject to periodic maintenance , 2009 .

[12]  Chengbin Chu,et al.  A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

[13]  Pradip Kumar Sadhu,et al.  Deterministic and stochastic approach for safety and reliability optimization of captive power plant maintenance scheduling using GA/SA-based hybrid techniques: A comparison of results , 2007, Reliab. Eng. Syst. Saf..

[14]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[15]  C. Richard Cassady,et al.  Genetic algorithms for integrated preventive maintenance planning and production scheduling for a single machine , 2005, Comput. Ind..

[16]  T. C. Edwin Cheng,et al.  Single-machine scheduling with periodic maintenance to minimize makespan , 2007, Comput. Oper. Res..

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

[18]  C. Richard Cassady,et al.  Minimizing Job Tardiness Using Integrated Preventive Maintenance Planning and Production Scheduling , 2003 .

[19]  Manoj Kumar Tiwari,et al.  Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach , 2006 .

[20]  M. Zandieh,et al.  Scheduling sequence-dependent setup time job shops with preventive maintenance , 2009 .

[21]  Abdelhakim Artiba,et al.  Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints , 2004, Comput. Ind. Eng..

[22]  Jen-Shiang Chen,et al.  Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan , 2008, Eur. J. Oper. Res..

[23]  Chengbin Chu,et al.  Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times , 2009, Eur. J. Oper. Res..

[24]  Chien-Hung Lin,et al.  Makespan minimization for two parallel machines with an availability constraint , 2005, Eur. J. Oper. Res..

[25]  Riad Aggoune,et al.  Minimizing the makespan for the flow shop scheduling problem with availability constraints , 2001, Eur. J. Oper. Res..

[26]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[27]  Mohamed Haouari,et al.  Optimal parallel machines scheduling with availability constraints , 2005, Discret. Appl. Math..

[28]  C. Richard Cassady,et al.  Integrating preventive maintenance planning and production scheduling for a single machine , 2005, IEEE Transactions on Reliability.

[29]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[30]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[31]  Zhi-Long Chen,et al.  Scheduling jobs and maintenance activities on parallel machines , 2000 .

[32]  Chung Yee Lee,et al.  Parallel-machine scheduling under potential disruption , 2007, Optim. Lett..

[33]  Wen‐Jinn Chen,et al.  Scheduling with different maintenance policies in a textile company , 2005 .

[34]  Jorge M. S. Valente,et al.  Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time , 2005, Comput. Ind. Eng..

[35]  Mitsuo Gen,et al.  Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm , 2006, J. Intell. Manuf..

[36]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[37]  Pierre Borne,et al.  Minimizing the makespan for the MPM job-shop with availability constraints , 2008 .

[38]  Chung Yee Lee,et al.  Scheduling maintenance and semiresumable jobs on a single machine , 1999 .

[39]  Chien-Hung Lin,et al.  Makespan minimization for two parallel machines with an unavailable period on each machine , 2007 .

[40]  N.M. Najid,et al.  A modified simulated annealing method for flexible job shop scheduling problem , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[41]  Vitaly A. Strusevich,et al.  Planning Machine Maintenance in Two-Machine Shop Scheduling , 2006, Oper. Res..