Search

The selective maintenance problem (SMP) arises in many mission-oriented multi-component systems that are operated for consecutive missions interspersed with finite breaks, during which only limited component repairs can be performed due to constrained resources. This NP-hard problem decides which components to maintain and to what levels of repair to guarantee a pre-specified performance level during the subsequent mission. Over the last two decades, a sizeable body of literature has been published on this topic. However, the contributions have stagnated in quality, and most articles deal with small to moderate problems. This paper provides a critical review of the SMP literature. A total of 136 research articles related to SMP are reviewed and a selection of key representative models is discussed in detail. This review is framed according to two feature categories: formulation characteristics, composed of three sub-groups of characteristics related to the system, maintenance and mathematical model characteristics; and solution approaches, grouped by exact methods and approximate algorithms. This critical review is aimed at identifying drawbacks, shortcomings, and blind spots of the SMP literature, and providing a roadmap for the challenges to be addressed and innovative future research topics to further advance the academic and industrial contributions of SMP. [ABSTRACT FROM AUTHOR]

Unlike mass production manufacturing systems, where configurations are rarely changed after the initial design, reconfigurable cyber-physical systems (RCPMS) self-change their structures throughout missions and thus self-adjust production in response to demand requirements. Accordingly, such a paradigm requires enhancing selective maintenance strategy to optimise scheduling maintenance actions, selecting configuration layouts for capacity and product family changes, and achieving maintenance cost reduction and reliability maximisation. This paper is the first to propose a robust model for a selective maintenance problem with imperfect repairs in the RCPMS context. The model also integrates uncertainties originating from the imperfect observations of components' health status. The model's objectives are to maximise the expected reliability and minimise the variance and maintenance cost under maintenance resource constraints. Moreover, we propose a new deep reinforcement learning framework for solving the resulting multi-objective and combinatorial optimisation problem. In addition, we use decision values to enhance the scalarisation process by permitting the priorities of specific objectives to be adjusted after the learning process. Furthermore, we employ Analytical Hierarchy Process to adjust the static priorities with respect to the objective functions and the actual learning context. Finally, broad experiments are conducted to highlight the performance of the proposed model and resolution framework. [ABSTRACT FROM AUTHOR]

This paper introduces a solution method for the multimission selective maintenance problem (SMP) that combines column-generation (CG) and genetic algorithms (GAs). The multimission SMP is an optimisation problem that arises when a system performs a sequence of missions separated by breaks of finite duration. During these finite breaks, only a subset of possible maintenance actions can be performed due to resource limitations. The problem is in deciding what actions to perform during each break duration such that the system meets or exceeds a minimum target reliability for all missions. The resulting optimisation problems are usually modelled as mixed integer nonlinear mathematical programmes, which are hard to solve. They are usually solved using metaheuristics. We propose a solution method based on CG framework in which the subproblems are solved using a GA. By integrating the GA within the classical CG framework, high-quality solutions can be obtained very quickly. The proposed solution method is capable of solving systems composed of both parallel and k-out-of-n:G subsystems. This hybrid CG algorithm is shown to obtain near optimal solutions and outperform other metaheuristic solution methods; it is also shown to be capable of solving large-scale systems composed of many subsystems and hundreds of components in a reasonable amount of time. [ABSTRACT FROM AUTHOR]

Selective maintenance is an important condition-based maintenance strategy for multi-component systems, where optimal maintenance actions are identified to maximize the success likelihood of subsequent missions. Most of the existing works on selective maintenance assumed that after each mission, the components' states can be precisely known without additional efforts. In engineering scenarios, the states of the components in a system need to be revealed by inspections that are usually inaccurate. Inspection activities also consume the limited resources shared with maintenance activities. We, thus, put forth a novel decision framework for selective maintenance of partially observable systems with which maintenance and inspection activities will be scheduled in a holistic and interactively sequential manner. As the components' states are partially observable and the remaining resources are fully observable, we formulate a finite-horizon Mixed Observability Markov Decision Process (MOMDP) model to support the optimization. In the MOMDP model, both maintenance and inspection actions can be interactively and sequentially planned based on the distributions of components' states and the remaining resources. To improve the solution efficiency of the MOMDP model, we customize a Deep Value Network (DVN) algorithm in which the maximum mission success probability is approximated. A five-component system and a real-world multi-state coal transportation system are used to demonstrate the effectiveness of the proposed method. It is shown that the probability of the system successfully completing the next mission can be significantly increased by taking inspections into account. The results also demonstrate the computational efficiency of the customized DVN algorithm. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

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.Alist 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. [ABSTRACT FROM AUTHOR]

Maintenance is indispensable for ensuring that multi-component systems successfully complete the next mission. Maintenance activities require an enormous amount of energy consumption in engineering problems. For selective maintenance, many studies focus on the trade-off between system reliability and other resources, such as time and cost. The enormous energy consumption of maintenance processes has been ignored in previous research. In this work, a novel energy consumption model considering the actual maintenance process is proposed. Moreover, system reliability is added to the optimization model as a crucial constraint, which makes the optimization process of energy consumption meaningful. The selective maintenance process is a complex combinatorial optimization problem. Hence, a hybrid differential evolution and gravitational search algorithm (DGSA) is proposed to solve the selective maintenance problem considering energy consumption. In addition, several experiments with DGSA, particle swarm optimization and differential evolution are designed to demonstrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Selective maintenance, as a pervasive maintenance policy in both military and industrial environments, aims to achieve the maximum success of subsequent missions under limited maintenance resources by choosing an optimal subset of feasible maintenance actions. The existing works on selective maintenance optimization all assume that the condition of components in a system can be perfectly observed after the system completes the last mission. However, such a premise may not always be true in reality due to the limited accuracy/precision of sensors or inspection instruments. To fill this gap, a new robust selective maintenance model is proposed in this work to consider uncertainties that originate from imperfect observations. The uncertainties associated with imperfect observations are incorporated into the states and effective ages of components via Bayes rule. The Kijima type II model, as a specific imperfect maintenance model, is used to characterize the imperfect maintenance efficiency of each selected maintenance action. The expectation and variance of the probability of a repairable system successfully completing the subsequent mission are derived to quantify the uncertainty that is propagated from imperfect observations. To guarantee the robustness of a selective maintenance strategy under uncertainties, a multi-objective selective maintenance model is constructed with the aims of maximizing the expectation of the probability that a system successfully completes the subsequent mission and to simultaneously minimizing the variance in this probability. The Pareto-optimality approach is utilized to offer a set of non-dominated solutions. Two illustrative examples are presented to demonstrate the advantages of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we propose a statistical and optimization framework for selective maintenance of a complex system with components that have multiple failure modes. Specifically, we study the case where each component has multiple instantaneous hard failure modes and a single soft failure mode. An imperfect maintenance action reduces the effective age and degradation level of a component while increasing the mean degradation parameter and the failure rates of hard failures. A numerical example illustrates the application of the proposed framework and the effectiveness of the Genetic Algorithm and Differential Evolution heuristics in solving such maintenance optimization problems. [ABSTRACT FROM AUTHOR]

In many industrial environments, maintenance is performed during successive mission breaks. In these conditions, it may not be feasible to perform all possible maintenance actions due to limited maintenance resources such as time, budget, repairman availability, etc. A subset of maintenance actions is then performed on selected components such that the system is able to meet the next mission requirement. Such a maintenance policy is calledselective maintenance. In this article, a selective maintenance strategy is developed for a MultiState System (MSS). The system can have several finite levels of performance in an MSS. Previous studies on selective maintenance have solely focused on MSSs with binary components. However, components in an MSS may be in more than two possible states. Hence, a series-parallel MSS that consists of multistate components is considered in this article. Imperfect maintenance of a component is considered to be a maintenance option, along with the replacement and the do-nothing options. Maintenance resources need to be allocated such that maximum system reliability during the next mission is ensured. A universal generating function is used to determine system reliability. An illustrative example is presented that depicts the advantages of utilizing imperfect maintenance/repair options. [ABSTRACT FROM AUTHOR]

In this paper we consider the problem of determining the optimum number of repairable and replaceable components to maximize a system's reliability when both, the cost of repairing the components and the cost of replacement of components by new ones, are random. We formulate it as a problem of non-linear stochastic programming. The solution is obtained through Chance Constrained programming. We also consider the problem of finding the optimal maintenance cost for a given reliability requirement of the system. The solution is then obtained by using Modified E-model. A numerical example is solved for both the formulations. [ABSTRACT FROM AUTHOR]