Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study

ABSTRACT In this article, the impact of preventive maintenance policies on the constructive heuristics performance for the no-wait flow-shop problem with total flow-time minimization is evaluated. The main constructive heuristics for the m-machine no-wait flow-shop scheduling problem with total flow-time minimization are compared through computational experiments with a set of 5760 problems. The results show that the adopted parameters significantly affect the performance of the constructive heuristics; also, the computational effort required to solve the problems increases owing to the complexity of the function-objective calculation. Heuristics proposed by Laha and Sapkal (LSH) and Framinan, Nagano and Moccellin (FNMH) provide the best solutions for both evaluated policies.

[1]  Parviz Fattahi,et al.  Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities , 2013 .

[2]  Kamran Shahanaghi,et al.  Scheduling flowshops with condition-based maintenance constraint to minimize expected makespan , 2010 .

[3]  T. C. Edwin Cheng,et al.  Single-machine scheduling with a variable maintenance activity , 2015, Comput. Ind. Eng..

[4]  Xiaohui Chen,et al.  Joint optimization of production scheduling and machine group preventive maintenance , 2016, Reliab. Eng. Syst. Saf..

[5]  Ali Allahverdi,et al.  The third comprehensive survey on scheduling problems with setup times/costs , 2015, Eur. J. Oper. Res..

[6]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

[7]  D. Chaudhuri,et al.  Heuristic algorithms for continuous flow-shop problem , 1990 .

[8]  George L. Vairaktarakis,et al.  The No-Wait Flow Shop , 2013 .

[9]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

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

[11]  Andrew Junfang Yu,et al.  Minimizing tardiness and maintenance costs in flow shop scheduling by a lower-bound-based GA , 2016, Comput. Ind. Eng..

[12]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

[13]  Marcelo Seido Nagano,et al.  A new evolutionary clustering search for a no-wait flow shop problem with set-up times , 2012, Eng. Appl. Artif. Intell..

[14]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

[15]  Jatinder N. D. Gupta,et al.  A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops , 2014, J. Oper. Res. Soc..

[16]  Xiaojun Zhou,et al.  Preventive maintenance optimization for a multi-component system under changing job shop schedule , 2012, Reliab. Eng. Syst. Saf..

[17]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

[18]  Dipak Laha,et al.  An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop , 2014, Comput. Ind. Eng..

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

[20]  Roman Senkerik,et al.  Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan , 2013, Math. Comput. Model..

[21]  Alessandro Birolini.  Reliability Engineering: Theory and Practice , 1999 .

[22]  J. Framiñan,et al.  An efficient heuristic for total flowtime minimisation in no-wait flowshops , 2010 .

[23]  Ming Liu,et al.  Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method , 2014 .

[24]  Quan-Ke Pan,et al.  Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization , 2013 .

[25]  Edy Bertolissi,et al.  Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .

[26]  Samir Lamouri,et al.  Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan , 2008 .

[27]  Lucio Bianco,et al.  Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates , 1999 .

[28]  Marcelo Seido Nagano,et al.  A constructive heuristic for total flowtime minimization in a no-wait flowshop with sequence-dependent setup times , 2015 .

[29]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[30]  Marcelo Seido Nagano,et al.  An evolutionary clustering search for the total tardiness blocking flow shop problem , 2017, Journal of Intelligent Manufacturing.

[31]  Laurent Deroussi.  The Flow‐Shop Problem , 2016 .

[32]  Marcelo Seido Nagano,et al.  A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem , 2016 .

[33]  Z. A. Lomnicki,et al.  Mathematical Theory of Reliability , 1966 .

[34]  Rubén Ruiz,et al.  Some effective heuristics for no-wait flowshops with setup times to minimize total completion time , 2007, Ann. Oper. Res..

[35]  Marcelo Seido Nagano,et al.  An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times , 2014, Expert Syst. Appl..

[36]  Xiaojun Zhou,et al.  Opportunistic preventive maintenance scheduling for serial-parallel multistage manufacturing systems with multiple streams of deterioration , 2017, Reliab. Eng. Syst. Saf..

[37]  Marcelo Seido Nagano,et al.  Review and classification of constructive heuristics mechanisms for no-wait flow shop problem , 2016 .

[38]  Dunwei Gong,et al.  A Heuristic Genetic Algorithm for No-Wait Flowshop Scheduling Problem , 2007 .

[39]  Bertrand M. T. Lin,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

[40]  Byung-Cheon Choi,et al.  Flow shops with machine maintenance: Ordered and proportionate cases , 2010, Eur. J. Oper. Res..

[41]  Yufang Chiu,et al.  Rescheduling strategies for integrating rush orders with preventive maintenance in a two-machine flow shop , 2012 .

[42]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

[43]  Vitaly A. Strusevich,et al.  Two-machine flow shop no-wait scheduling with machine maintenance , 2005, 4OR.

[44]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[45]  M. F. Tasgetiren,et al.  A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[46]  A. Allahverdi,et al.  Algorithms for no-wait flowshops with total completion time subject to makespan , 2013 .

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

[48]  Ronald G. McGarvey,et al.  Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated , 2004, J. Oper. Res. Soc..

[49]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .