A literature review on selective maintenance for multi‐unit systems

Selective maintenance is regarded as a type of profit‐generating maintenance policy, playing an important role in balancing limited maintenance resources with system performance. Since 1988, increasing interest has been focused on this research area. Nevertheless, to the best of our knowledge, there is a lack of critical reviews of selective maintenance. This paper is the first systematic review focusing on this relevant topic. In this work, a definition and some specific features of selective maintenance are elaborated. Based on these features, a set of criteria that have been considered in selective maintenance optimization are summarized into 3 categories: system characteristics, maintenance characteristics, and mission profile characteristics. Based on these criteria, a comprehensive literature review on selective maintenance is undertaken. The solution approaches, as well as a general procedure for selective maintenance optimization, are discussed. Finally, some possible directions for further research are provided.     

A tabu‐search‐based algorithm for continuous multiminima problems

Tabu search algorithms are becoming very popular in operational research community. A lot of works and studies were carried out from the first presentation of Glover. The development of tabu search techniques concerns in almost all cases combinatorial problems, and we found very few papers about continuous problems. In this work, we briefly classify and describe the main continuous approaches to tabu search, then we will present a novel algorithm which explores a grid of points with a distance dynamically defined, it collapses to a local minimum then it continues the search from that point accepting some non‐improving points to allow the exploration of new regions of the domain. The proposed algorithm is deterministic with a little random component triggered only when loop conditions are detected and it contains a simple vocabulary building mechanism and a diversification procedure. Finally we show some comparisons with other optimization algorithms and a possible application of this method to an engineering problem. Copyright © 2001 John Wiley & Sons, Ltd.     

Selective maintenance optimisation for series-parallel systems alternating missions and scheduled breaks with stochastic durations

This paper deals with the selective maintenance problem for a multi-component system performing consecutive missions separated by scheduled breaks. To increase the probability of successfully completing its next mission, the system components are maintained during the break. A list of potential imperfect maintenance actions on each component, ranging from minimal repair to replacement is available. The general hybrid hazard rate approach is used to model the reliability improvement of the system components. Durations of the maintenance actions, the mission and the breaks are stochastic with known probability distributions. The resulting optimisation problem is modelled as a non-linear stochastic programme. Its objective is to determine a cost-optimal subset of maintenance actions to be performed on the components given the limited stochastic duration of the break and the minimum system reliability level required to complete the next mission. The fundamental concepts and relevant parameters of this decision-making problem are developed and discussed. Numerical experiments are provided to demonstrate the added value of solving this selective maintenance problem as a stochastic optimisation programme.     

基于机会维修策略的预防性维修优化模型研究

为了利用系统内故障部件维修的机会,考虑部件之间在维修方面存在的相关性情况,提出了将机会维修信息融入系统预防性维修的优化模型．该模型在比较按机会预防性维修和按计划预防性维修期望效益的基础上,以系统内故障时机为优化变量、部件维修费用率最小化为目标进行系统预防性维修优化,使确定部件在不同的故障来源时机可提前预防性维修的阈值．最后通过算例,表明不同故障的机会维修阈值对部件预防性维修效果的影响差异,为系统预防性维修决策提供有力的支持．     

Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method

This paper investigates an integrated bi-objective optimisation problem with non-resumable jobs for production scheduling and preventive maintenance in a two-stage hybrid flow shop with one machine on the first stage and m identical parallel machines on the second stage. Sequence-dependent set-up times and preventive maintenance (PM) on the first stage machine are considered. The scheduling objectives are to minimise the unavailability of the first stage machine and to minimise the makespan simultaneously. To solve this integrated problem, three decisions have to be made: determine the processing sequence of jobs on the first stage machine, determine whether or not to perform PM activity just after each job, and specify the processing machine of each job on the second stage. Due to the complexity of the problem, a multi-objective tabu search (MOTS) method is adapted with the implementation details. The method generates non-dominated solutions with several parallel tabu lists and Pareto dominance concept. The performance of the method is compared with that of a well-known multi-objective genetic algorithm, in terms of standard multi-objective metrics. Computational results show that the proposed MOTS yields a better approximation.     

Optimal joint selective imperfect maintenance and multiple repairpersons assignment strategy for complex multicomponent systems

This paper addresses the joint selective maintenance and repairperson assignment problem (JSM–RAP) for complex multicomponent systems. The systems perform consecutive missions separated by scheduled finite duration breaks and are imperfectly maintained during the breaks. Current selective maintenance (SM) models usually assume that only one repair channel is available or that the repairperson assignment optimisation can be done at a subsequent stage. Using a generalised reliability function for k-out-of-n systems, we formulate the JSM–RAP for multicomponent systems more complex than the series-parallel systems commonly used in previous SM models. Two nonlinear formulations and their corresponding binary integer programming models are then proposed and optimally solved. Numerical experiments show the added value of the proposed approach and highlight the benefit of jointly carrying out the selection of the components to be maintained, the maintenance level to be performed and the assignment of the maintenance tasks to repairpersons. It is also shown that the flexibility provided by mixed skill cohorts of repairpersons over uniform cohorts can yield higher performance levels when the skillsets are significantly different.     

A tabu search approach for buffer allocation in production lines with unreliable machines

The optimal allocation of buffers is an important research issue in designing production lines. In this study, a tabu search (TS) algorithm is proposed to find near-optimal buffer allocation plans for a serial production line with unreliable machines. The main objective is to maximize the production rate, i.e. throughput, of the line. The efficiency of the proposed method is also tested to solve buffer allocation problems with the objective of total buffer size minimization. To estimate the throughput of the line with a given specific buffer allocation, an analytical decomposition approximation method is used. The performance of the tabu search algorithm is demonstrated on existing benchmark problems. The results obtained by the TS algorithm are clearly encouraging, as the TS algorithm is much better than the other algorithms for all considered benchmark problems.     

Joint optimisation of production rate and preventive maintenance in machining systems

This paper studies an integrated control strategy of production and maintenance for a machining system which produces a single type of product to meet the constant demand. Different from previous research, we assume in this study that during the production, the production rate not only influences the life of cutting tool, but also the reliability of the machine. Both the replacement of cutting tool and the preventive maintenance (PM) of machine are considered in this paper. The machine is preventively maintained at the Nth tool replacement or correctively repaired at the machine failure, whichever occurs first. PM and corrective repair may cause shortage which can be reduced by controlling inventory. There are two decision variables p and N, where p denotes the production rate and N denotes the number of cutting tool replacement before the PM is performed. An integrated model is developed to simultaneously determine the optimal production rate and PM policy that minimise the total expected cost per unit item produced. Finally, an illustrative example and sensitivity analysis are given to demonstrate the proposed model.     

Generalized non‐stationary preventive maintenance model for deteriorating repairable systems

This paper deals with a practical approach for the analysis and modelling of preventive maintenance (PM) data for repairable systems which have an increasing failure frequency and/or increasing severity. The concept and testing for the trend of severity of corrective work (CO) and PM are discussed. A framework for statistical analysis of interarrival times and downtimes due to CO/PM is proposed. A generalized non‐stationary model for scheduling PM to maximize availability is suggested. The effect of severity on scheduling PM activities is shown through sensitivity analysis. Copyright © 2002 John Wiley & Sons, Ltd.     

A reliability/availability approach to joint production and maintenance scheduling with multiple preventive maintenance services

In classical scheduling problems, it is often assumed that the machines are available during the whole planning horizon, while in realistic environments, machines need to be maintained and therefore may become unavailable within production periods. Hence, in this paper we suggest a joint production and maintenance scheduling (JPMS) with multiple preventive maintenance services, in which the reliability/availability approach is employed to model the maintenance aspects of a problem. To cope with the suggested JPMS, a mixed integer nonlinear programming model is developed and then a population-based variable neighbourhood search (PVNS) algorithm is devised for a solution method. In order to enhance the search diversification of basic variable neighbourhood search (VNS), our PVNS uses an epitome-based mechanism in each iteration to transform a group of initial individuals into a new solution, and then multiple trial solutions are generated in the shaking stage for a given solution. At the end of the local search stage, the best obtained solution by all of the trial solutions is recorded and the worst solution in population is replaced with this new solution. The evolution procedure is continued until a predefined number of iterations is violated. To validate the effectiveness and robustness of PVNS, an extensive computational study is implemented and the simulation results reveal that our PVNS performs better than traditional algorithms, especially in large size problems.     

A combined global and local search method to deal with constrained optimization for continuous tabu search

Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraint‐free optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is sometimes inefficient, especially for equality constraints, as it is difficult to keep the global search within the feasible region by purely adding a penalty to the objective function. A combined global and local search method is proposed in this paper to deal with constrained optimizations. It is demonstrated by combining continuous tabu search (CTS) and sequential quadratic programming (SQP) methods. First, a nested inner‐ and outer‐loop method is presented to lead the search within the feasible region. SQP, a typical local search method, is used to quickly solve a non‐linear programming purely for constraints in the inner loop and provides feasible neighbors for the outer loop. CTS, in the outer loop, is used to seek for the global optimal. Finally, another local search using SQP is conducted with the results of CTS as initials to refine the global search results. Efficiency is demonstrated by a number of benchmark problems. Copyright © 2008 John Wiley & Sons, Ltd.     

Pattern‐based prognostic methodology for condition‐based maintenance using selected and weighted survival curves

This paper proposes a pattern‐based prognostic methodology that combines logical analysis of data (LAD) as an event‐driven diagnostic technique, and Kaplan–Meier (KM) estimator as a time‐driven technique. LAD captures the effect of the instantaneous conditions on the health state of a monitored system, while KM estimates the baseline reliability curve that reflects the effect of aging, based on the observed historical failure times. LAD is used to generate a set of patterns from the observed values of covariates that represent the operating conditions and condition indicators. A pattern selection procedure is carried out to select the set of significant patterns from all the generated patterns. A survival curve is estimated, for each subset of observations covered by each selected pattern. A weight that reflects the coverage of each pattern is assigned to its survival curve. Given a recently collected observation, the survival curve of a monitored system is updated on the basis of the patterns covering that observation. The updated curve is then used to predict the remaining useful life of the monitored system. The proposed methodology is validated using a common dataset in prognostics: the turbofan degradation dataset that is available at NASA prognostic repository. Copyright © 2017 John Wiley & Sons, Ltd.     

Preventive maintenance policy of single‐unit systems based on shot‐noise process

This paper develops reliability and maintenance models for a single‐unit system subject to hard failures under random environment of external shocks. Motivated by the observations of shot‐noise process in practice, the impact of shock damage on system failure behavior is characterized by random hazard rate increments. To remove such negative impact, imperfect preventive repair is performed periodically, and preventive replacement is performed after several repairs. Considering the joint effects of both random shocks and imperfect repair on the system hazard rate, we derive recursive equations for the system reliability function. Furthermore, we investigate the optimal maintenance policy that minimizes the expected cost per unit time of the system. The applicability of the reliability and maintenance model is validated by a case study on a wind turbine system.     

Availability optimisation for stochastic degrading systems under imperfect preventive maintenance

This paper deals with imperfect preventive maintenance (PM) optimisation problem. The system to be maintained is typically a production system assumed to be continuously monitored and subject to stochastic degradation. To assess such degradation, the proposed maintenance model takes into account both corrective maintenance (CM) and PM. The system undergoes PM whenever its reliability reaches an appropriate value, while CM is performed at system failure. After a given number of maintenance actions, the system is preventively replaced by a new one. Both CM as well as PM are considered imperfect, i.e. they bring the system to an operating state which lies between two extreme states, namely the as bad as old state and as good as new state. The imperfect effect of CM and PM is modelled on the basis of the hybrid hazard rate model. The objective of the proposed PM optimisation model consists on finding the optimal reliability threshold together with the optimal number of PM actions to maximise the average availability of the system. A mathematical model is then proposed. To solve this problem an algorithm is provided. A numerical example is presented to illustrate the proposed maintenance optimisation model.     

An adaptive degradation‐based maintenance model taking into account both imperfect adjustments and AGAN replacements

This paper presents an adaptive maintenance model for equipment that can be adjusted (minor preventive maintenance, imperfect state) or replaced (major preventive maintenance, as good as new) at specific scheduled times based on degradation measurements. An initial reliability law that uses a degradation‐based model is built from the collection of hitting times of a failure threshold. Inspections are performed to update the reliability, the remaining useful life, and the optimum time for preventive maintenance. The case of both as good as new replacements and imperfect adjustments is considered. The proposed maintenance model is based on the optimization of the long‐term expected cost per unit of time. The model is then tested on a numerical case study to assess its effectiveness. This results in an improvement for the occurrences of maintenance tasks that minimizes the mean cost per unit of time as well as an optimized number of adjustments that can be considered before replacing an item. The practical application is a decision aid support to answer the 2 following questions: Should we intervene now or wait for the next inspection? For each intervention, should we adjust or replace the item of equipment? The originality is the presence of 2 criteria that help the maintainer to decide to postpone or not the preventive replacement time depending on the measured degradation and to decide whether the item should be adjusted or replaced.     

A variable neighbourhood search for integrated production and preventive maintenance planning in multi-state systems

This paper presents a variable neighbourhood search (VNS) to the integrated production and maintenance planning problem in multi-state systems. VNS is one of the most recent meta-heuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried out. In the studied problem, production and maintenance decisions are co-ordinated, so that the total expected cost is minimised. We are given a set of products that must be produced in lots on a multi-state production system during a specified finite planning horizon. Planned preventive maintenance and unplanned corrective maintenance can be performed on each component of the multi-state system. The maintenance policy suggests cyclical preventive replacements of components, and a minimal repair on failed components. The objective is to determine an integrated lot-sizing and preventive maintenance strategy of the system that will minimise the sum of preventive and corrective maintenance costs, setup costs, holding costs, backorder costs and production costs, while satisfying the demand for all products over the entire horizon. We model the production system as a multi-state system with binary-state components. The formulated problem can be solved by comparing the results of several multi-product capacitated lot-sizing problems. The proposed VNS deals with the preventive maintenance selection task. Results on test instances show that the VNS method provides a competitive solution quality at economically computational expense in comparison with genetic algorithms.     

A full history proportional hazards model for preventive maintenance scheduling

This paper is concerned with the development of a realistic preventive maintenance (PM) scheduling model. A heuristic approach for implementing the semi-parametric proportional-hazards model (PHM) to schedule the next preventive maintenance interval on the basis of the equipment's full condition history is introduced. This heuristic can be used with repairable systems and does not require the unrealistic assumption of renewal during repair, or even during PM. Two PHMs are fitted, for the life of equipment following corrective work and the life of equipment following PM, using appropriate explanatory variables. These models are then used within a simulation framework to schedule the next preventive maintenance interval. Optimal PM schedules are estimated using two different criteria, namely maximizing availability over a single PM interval and over a fixed horizon. History data from a set of four pumps operating in a continuous process industry is also used to demonstrate the proposed approach. The results indicate a higher availability for the recommended schedule than the availability resulting from applying the optimal PM intervals as suggested by using the conventional stationary models. © 1997 John Wiley & Sons, Ltd.     

A method combining rules with genetic algorithm for minimizing makespan on a batch processing machine with preventive maintenance

This paper considers the problem of minimising makespan on a single batch processing machine with flexible periodic preventive maintenance. This problem combines two sub-problems, scheduling on a batch processing machine with jobs’ release dates considered and arranging the preventive maintenance activities on a batch processing machine. The preventive maintenance activities are flexible but the maximum continuous working time of the machine, which is allowed, is determined. A mathematical model for integrating flexible periodic preventive maintenance into batch processing machine problem is proposed, in which the grouping of jobs with incompatible job families, the starting time of batches and the preventive maintenance activities are optimised simultaneously. A method combining rules with the genetic algorithm is proposed to solve this model, in which a batching rule is proposed to group jobs with incompatible job families into batches and a modified genetic algorithm is proposed to schedule batches and arrange preventive maintenance activities. The computational results indicate the method is effective under practical problem sizes. In addition, the influences of jobs’ parameters on the performance of the method are analyzed, such as the number of jobs, the number of job families, jobs’ processing time and jobs’ release time.