International Journal of Performability Engineering, 2018, 14(12): 2960-2970 doi: 10.23940/IJPE.18.12.P6.29602970

Selective Maintenance Decision-Making of Complex Systems Considering Imperfect Maintenance

Shaohua Wang,a, Shixin Zhanga, Yong Lia, Hongxiang Liub, and Zhengjun Pengc

a Department of Support and Remanufacture, Beijing, 100072, China

b Department of Scientific and Academic Research, Beijing, 100072, China

c Unit 77626 of Army, Lhasa,850000, China

*Corresponding Author(s): * E-mail address: aafe77330@163.com

Accepted:  Published:   

Abstract

Aiming at enhancing the mission reliability of complex systems composed of sequential-parallel parts, a sequential condition deterioration process model was constructed. To better illustrate the effect of varied maintenance behaviors, minimal maintenance, imperfect maintenance, and replacement were taken as optional maintenance actions and modeled. To achieve the maximization of current reliability, a selective maintenance decision-making model and the attached artificial solving measures were brought forward. The case study showed that by integrating the service age reduction model and hazard adjusting model, the imperfect maintenance model can model the actual reliability of the system better. Also, within a given maintenance time, imperfect maintenance was useful for offering more feasible maintenance plans, and the system reliability can be better promoted as a result.

Keywords: the mission interval; selective maintenance; imperfect maintenance; genetic algorithm

PDF (447KB) Metadata Related articles Export EndNote| Ris| Bibtex

Cite this article

Shaohua Wang, Shixin Zhang, Yong Li, Hongxiang Liu, Zhengjun Peng. Selective Maintenance Decision-Making of Complex Systems Considering Imperfect Maintenance. International Journal of Performability Engineering, 2018, 14(12): 2960-2970 doi:10.23940/IJPE.18.12.P6.29602970

1. Introduction

Performing continuous tasks is an inherent feature of military equipment and other complex systems, so to meet the required reliability of continuous tasks, it is necessary to arrange maintenance work scientifically during the mission interval of equipment [1-2]. Constrained by time, limited available resources, maintenance costs, and other factors, the amount of feasible maintenance actions set are finite [1-4]. It is obvious that when the task interval length is limited, a series of selective maintenance actions must be chosen to maximize the reliability of continuous tasks, while the time consumption can meet the constraint. Then, the continuous missions can be guaranteed to the maximum degree.

The decision content of selective maintenance mainly includes the selection of the maintenance subjects and the corresponding maintenance actions. Some research has been done on selective maintenance. Bris [1] assumed that all components of the system were subject to random failure and that replacement was the only maintenance option. Aiming at minimizing maintenance costs and meeting the system availability requirement, a selective maintenance decision-making method for complex system was put forward. Wildeman [5] and Yao [6] proposed a combinational maintenance decision making model for multi-component systems by taking replacement and minimal repair as alternative actions. Cassady [7] et al. supposed the components follow the Weibull distribution[8] and the available maintenance time is limited. They established a decision-making model aiming at the maximization of mission reliability, while considering minimal repair and replacement as optional actions. Moghaddam [9] took the running age into account and proposed a selective maintenance decision model aiming at maximizing the reliability of the system under limited maintenance costs. Pandey [10] assumed that the system components follow the exponential distribution and established maintenance decision models using different solving algorithms. However, the exponential distribution does not fit most mechanical systems, and optimal maintenance decision-making at the component level might lead to the loss of overall benefit for the system, so the model requires further research. In fact, maintenance usually cannot recover the condition of complex systems to brand-new; many maintenance actions are in fact imperfect. The effect of imperfect maintenance should be considered in the models. Modeling of imperfect maintenance is helpful for enhancing the modeling accuracy of system conditions and engineering application prospects. Moghaddam[11] analyzed the effect of imperfect maintenance on equivalent age but did not illustrate the relationship between the age and the maintenance soundly. To deal with this disadvantage, Pandey [8] established an equivalent age transition model reflecting the effect of imperfect maintenance on actual running time, and a single selective maintenance decision method was studied. Mayank [12] took imperfect maintenance into account and proposed a sequential selective maintenance decision method during a finite time span for systems composed of multiple components, aiming at the optimization of task reliability. A preventive maintenance frequency optimization model through given life spanwas also presented. However, the optimization model took the maintenance decision-making as a single maintenance decision problem, which made the model lack flexibility. Making real-time maintenance decisions according to the real-time system status was the key problem. Also, this model failed to differentiate preventive maintenance and corrective maintenance consequences, which affected the utilization of the model. Based on the fact that the system state updatesalong with the execution process of the continuous tasks, to improve the selective maintenance decision-making efficiency influenced by imperfect maintenance, a maintenance action set composed of minimal maintenance, imperfect repair, preventive replacement, and corrective replacement was proposed as a maintenance option. An optimal maintenance decision-making model was proposed for system performing mission in series, and the solving algorithm was also studied.

2. System Reliability under Continuous Tasks

2.1. Condition of the System

Complex large-scale systems usually can be regarded as complex series-parallel systems. Assume one system is composed of m subsystem connected in series, and the subsystem i(i =1,2, ,m) is composed of ni components connected in parallel. Then, the sum number of the component in the system is N=$\sum\limits_{i=1}^{m}{{{n}_{i}}}$. Assume the life of each component in the system follows the Weibull distribution:

$f(t)=\left( \left( \beta {{t}^{\beta -1}} \right)/{{\alpha }^{\beta }} \right){{e}^{-}}^{{{(t/\alpha )}^{\beta }}},\text{ }t\ge 0,\text{ }\beta >0,\text{ }\alpha >0$

The states of the components and the system are identified as functioning or failure, and maintenance can recover the state to functioning from failure. Suppose the ages of all components are 0 at the beginning. The system performs missions in sequence. The mission interval and followed task interval are supposed to be identical, and the two parameters of the kth mission are denoted as Ok and Mk respectively. The executive process of continuous missions is given in Figure 1.

Figure 1

Figure 1.   Sequential mission with maintenance


The consumption of time and resources and the recovery degree are determined according to maintenance actions. Among the actions, minimal repair, one kind of corrective maintenance, consumes the least amount of time and cost to recover the state but cannot enhance the reliability. The effect of imperfect repair, regardless of whether it ispreventive repair or corrective repair, usually goes between minimal repair and replacement, and the money and time consumption amount usually goes between minimal repair and replacement. It is reasonable to suppose that the repair degree is in positive correlation with the amount of money and time invested. Preventive replacement and corrective replacement both can recover the state to brand new, but corrective maintenance requires relatively more money and time for relatively more logistic time.

During one task interval, maintenance can change the state of the components and the task reliability of the maintenance subjects. Based on the structure of the system, the components’ identification number is coded in sequence, and the sth component is marked as s (1<s<$\sum\nolimits_{i=1}^{m}{{{n}_{i}}}$). Let k represent the accumulated task number and Xs(k) and Ys(k)the condition of component s before and after maintenance respectively, then

${{X}_{s}}(k)=\left\{ \begin{align} & 1;\text{ component}s\text{available}\text{before}\text{the}{{k}^{\text{th}}}\text{mission} \\ & 0;\text{ component}s\text{failure}\text{before}\text{the}{{k}^{\text{th}}}\text{mission} \\ \end{align} \right.$

In the equation, 0 means failure and 1 means functional.

When the kth mission is finished, the condition of component s can be presented as Ys(k):

${{Y}_{s}}(k)=\left\{ \begin{align} & 1;\text{ component}s\text{available}\text{after}\text{the}{{k}^{\text{th}}}\text{mission} \\ & 0;\text{ component}s\text{failure}\text{after}\text{the}{{k}^{\text{th}}}\text{mission} \\ \end{align} \right.$

Also, the state of the subsystem and the system can be presented with the same equations.

2.2. Maintenance Actions Modeling

According to section 1.1, the maintenance actions set is {minimal repair, imperfect repair, preventive replacement, corrective replacement}, and the imperfect repair can be distinguished into more specified types. The elements in the set are not always compatible, and the feasible actions rely on the state of maintenance subject. As for component k, if Ys(k)=1, no failure happensand the feasible actions only include imperfect maintenance and preventive replacement. IfYs(k)=0, the component fails and the feasible options are minimal repair, imperfect repair, and corrective replacement [12].

Let ls(k) represent the maintenance action variable of component s in the kth maintenance. Then, it is necessary to assign unique constant values to represent specified actions. To make the model easier to understand, the value assignment rule is determined and shown in Table 1.

Table 1.   Value assignment of maintenance actions l s(k)

Value012ps-2ps-1ps
Maintenance
action
No maintenanceMinimal
repair
Imperfect
Repair
Imperfect
repair
Preventive
replacement
Corrective
replacement

New window| CSV


It is shown in Table 1 that the codes of maintenance actions increase from 0 to ps to represent different maintenance actions. If l s(k)=1, the minimal repair is chosen, the fault is corrected with minimal cost, and the reliability before and after maintenance stays unchanged. It is necessary to point out that preventive maintenance is always better than minimal repair. By cleaning, adjusting, and correcting, the reliability of the maintenance subject can be partially promoted without replacement, and these kinds of maintenance actions all can be classified as imperfect maintenance. If the value of l s(k) is between 2 to ps-2, one imperfect maintenance action is chosen. The higher thel s(k), the higher the recovery degree.

There are currently two popular imperfect maintenance models. One is the age reduction method, which modifies the equivalent age with age reduction parameterb and changes the reliability consequently. Assuming the age before repair is t, the age will reduce by bt (0≤b≤1). The higher theb, the higher the reliability. The other modelmodifies the failure rate function λ(x), and after maintenance the failure rate function will be recovered to (x) (x>0, 0≤a≤1) from λ(x) (x>0). The lower thea, the higher the reliability. The two models can present the maintenance effect from different aspects.

It is necessary to note that increasing maintenance frequency does not necessarily lead to better performance. Besides the influence of imperfect maintenance, it is necessary to consider possible flaws resulting from imperfect repair.

To better describe the effect of imperfect maintenance and the chances of flawed maintenance, an integrated model is proposed. The failure rate change sketch-up map is presented in Figure 2.

Figure 2

Figure 2.   The schematic diagram of condition with imperfect maintenance


As shown isFigure 2, the first and second maintenance actions can reduce the failure rate to different degrees, and the decrease scale is predetermined according to maintenance actions. At the same time, the flaw brought in by imperfect maintenance will accumulate. Judging from the trend of the curve in Figure 2, the slope of the failure rate will get relatively higher along with the increment of maintenance times. As a result, the proposed model can better describe the actual characteristics of maintenance actions.

During the execution of sequential missions, assume the finish time of the first mission is t1 and the start time of the second mission is t2. Then, during the second mission, the failure rate function of component s can be calculated by Equation (1)[13]:

λs,1(t2+x)=s,0(bt1+x),x≥0, a≥1,0≤b≤1

In Equation (1), a is the correction parameter, b is the age reduction factor, λs,0(·) is the failure rate function of component s during the first episode, λs,1(·)the second episode, and so on. It is clear that the age of component s can be reduced to bt1 from t1 after imperfect maintenance, and a≥1can make the slope of the curve increase in Figure 1 to represent the potential negative influence of maintenance.

Before replacement, the failure rate function is updated with every maintenance. Suppose the correction parameters and age reduction factors are all recorded along with the failure rate function updates, and the records until the kth maintenance respectively are(as,1, as,2, , as,k) and (bs,1, bs,2, , bs,k). Then, the failure rate function of the (k+1)th mission is:

λs,k+1(tk+1+x)=As,kλ0,k(bs,kBs,k+x),x≥0

In the equation, tk+1 is the start time of the (k+1)th mission and ${{A}_{s}}_{,k}=\prod\limits_{p=1}^{k}{{{a}_{s,p}}}$ is the accumulated correction parameter of the failure rate function. The more maintenances are done, the higher the As,k, so redundant maintenance are not necessary; Bs,k is the equivalent age after the kth maintenance, and the influence on the equivalent age is also accumulated. The equivalent age is calculated as follows:

$\left\{ \begin{matrix} & {{B}_{s}}_{,k}={{b}_{s}}_{,k-1}{{B}_{s}}_{,k-1}+{{O}_{k}} \\ & ...... \\ & {{B}_{s}}_{,2}={{b}_{s}}_{,1}{{B}_{s}}_{,1}+{{O}_{2}} \\ & {{B}_{s}}_{,1}={{O}_{1}} \\ \end{matrix} \right.$

As shown in Figure 3, after the (k-1)th maintenance, the equivalent age is reduced to bs,k-1Bs,k-1 from Bs,k-1. It is obvious that O1, O2, , Ok-1 are all affected by bs,k-1. The model can depict the influence of all kinds of maintenance actions more precisely.

Figure 3

Figure 3.   Optimal selective maintenance decision-making process based on Genetic Algorithm


The value of b mainly is determined by the ageand the repair expenses. The more money and time invested in maintenance, the smaller the b and the better the condition after maintenance. For a given maintenance action, the lower the age, the smaller the band the better the condition after maintenance. The calculation measure of reference [12] is opted, and the age reduction parameter of the kth maintenance is calculated as follows:

${{b}_{s}}_{,k}({{B}_{s}}_{,k},{{l}_{s}})=1-{{\left( \frac{{{c}_{s}}_{,k}({{l}_{s}})}{{{c}_{s}}_{,R}} \right)}^{m({{B}_{s}}_{,k})}}$

In the equation, ${{c}_{s}}_{,k}({{l}_{s}})$ is the cost determined by maintenance action ls,${{c}_{s}}_{,R}$is the replacement cost of component s, and$m({{B}_{s,k}})$ is the characteristic index of the age. The value of $m({{B}_{s,k}})$ can be calculated by:

$m({{B}_{s}}_{,k})=\frac{{{B}_{s}}_{,k}}{\text{MR}{{\text{L}}_{s}}_{,k}}=\frac{{{B}_{s}}_{,k}}{\left( \frac{\int_{{{B}_{s}}_{,k}}^{\infty }{{{R}_{s}}_{,k}(x)\text{d}x}}{{{R}_{s}}_{,k}\left( {{B}_{s}}_{,k} \right)} \right)}$

In the equation, ${{B}_{s}}_{,k}$is the equivalent age and${{R}_{s}}_{,k}\left( {{B}_{s}}_{,k} \right)$ is the corresponding reliability. If the reliability of the component follows the Weibull distribution:

$\int_{{{B}_{s}}_{,k}}^{\infty }{{{R}_{s}}_{,k}(x)\text{d}x}=\exp \left( \frac{{{A}_{s}}_{,k-1}}{{{\alpha }_{s}}^{{{\beta }_{s}}}}{{({{b}_{s,k-1}}{{B}_{s,k-1}})}^{{{\beta }_{s}}}} \right)\times \int_{{{B}_{s}}_{,k}}^{\infty }{\exp \left( -\frac{{{A}_{s}}_{,k-1}}{{{\alpha }_{s}}^{{{\beta }_{s}}}}{{({{b}_{s,k-1}}{{B}_{s,k-1}}+x)}^{{{\beta }_{s}}}} \right)\text{d}x}$

To substitute Equation (6) into Equation (5):

$m({{B}_{s}}_{,k})=\frac{{{B}_{s}}_{,k}\times {{R}_{s}}_{,k}\left( {{B}_{s}}_{,k} \right)}{\exp \left( \frac{{{A}_{s}}_{,k-1}}{{{\alpha }_{s}}^{{{\beta }_{s}}}}{{({{b}_{s,k-1}}{{B}_{s,k-1}})}^{{{\beta }_{s}}}} \right)\times \int_{{{B}_{s}}_{,k}}^{\infty }{\exp \left( -\frac{{{A}_{s}}_{,k-1}}{{{\alpha }_{s}}^{{{\beta }_{s}}}}{{({{b}_{s,k-1}}{{B}_{s,k-1}}+x)}^{{{\beta }_{s}}}} \right)\text{d}x}}$

It is shown in Equation (4) that $m({{B}_{s,k}})>0$. The smaller the $m({{B}_{s,k}})$, the smaller the equivalent age after maintenance.The higher the $m({{B}_{s,k}})$, the higher the equivalent age.

Similar to the age reduction factor, the definition of the correction parameter is denoted as ${{a}_{s}}_{,k}({{B}_{s}}_{,k},{{l}_{s}})$:

${{a}_{s}}_{,k}({{B}_{s}}_{,k},{{l}_{s}})=\frac{q}{(q-1)+{{\left( {}^{{{c}_{s}}_{,k}({{l}_{s}})}/{}_{{{c}_{s}}_{,R}} \right)}^{{}^{1}/{}_{m({{B}_{s}}_{,k})}}}},\text{ }q>1$

In the equation, q is a constant value predetermined by experience. The higher the happening rate of flawed maintenance, the smaller the q.

To analyze from the reliability aspect, all maintenance actions can be taken as imperfect maintenance. In Equation (1), if a=1 and b=1, the age stays unchanged and the maintenance can be taken as minimal repair. If a=1 and b=0, the condition after maintenance can be taken as brand new, like replacement.

2.3. The Reliability of the System

The aim of maintenance is to maximize the task reliability of the next mission, so it is vital to make the most optimistic and feasible selective maintenance decision to meet the requirement. The recovery effect is straight determined by the action, and the failure rate function during the kth mission is:

${{\lambda }_{s}}_{,k}\left( {{t}_{k}}+x \right)=\left\{ \begin{align} & {{\lambda }_{s,k-1}}\left( {{B}_{s}}_{,k-1}+x \right);{{l}_{s,k-1}}\in \{0,1\} \\ & {{A}_{s}}_{,k-1}{{\lambda }_{s,k-1}}\left( {{b}_{s}}_{,k-1}{{B}_{s}}_{,k-1}+x \right);{{l}_{s,k-1}}\in \{2,\cdots ,{{p}_{s}}-2\} \\ & {{\lambda }_{s}}_{,0}(x);{{l}_{s,k-1}}\in \{{{p}_{s}}-1,{{p}_{s}}\} \\ \end{align} \right.$

In the equation, ls,k-1 is the code of the (k-1)th maintenance action. If ${{l}_{s,k-1}}\in \{0,1\}$, minimal repair or no repairis doneand the failure rate stay unchanged; if ${{l}_{s,k-1}}\in \{2,\cdots ,{{p}_{s}}-2\}$, imperfect maintenance is done; if ${{l}_{s,k-1}}\in \{{{p}_{s}}-1,{{p}_{s}}\}$, the component is replaced and the equivalent age is turned to 0 as a result.

According to Equation (9), the task reliabilityof components during the kth task is:

${{R}_{s}}_{,k}(k)=\exp \left( -\int_{0}^{{{O}_{k}}}{{{\lambda }_{s}}_{,k}({{t}_{k}}+x)\text{d}x} \right)$

The system reliability is:

$R(k)=\prod\limits_{i=1}^{m}{\left( 1-\prod\limits_{j=1}^{{{n}_{i}}}{\left( 1-{{R}_{j}}_{,k}(k) \right)} \right)}$

During continuous missions, the decision-making object is to minimize the cost while satisfying the constraint related to time and reliability. Judging from Equations (10) and (11), the reliability during the first task is determined only by the length of mission interval given the reliability model.

3. Maintenance Decision-Making Objects

As for complex systems performing tasks in series, time is often the major constraint. Therefore, based on the practical need, a maintenance decision-making object model wasbuilt.

3.1. Maintenance Time

All maintenance actions cost a certain amount of resources and time, and the detailed mapping relationship should be analyzed respectively. Assume the replacement time is constant. Compared withother maintenance actions, replacement usually costs a certain amount of logistic delay time, so it is reasonable to assume that replacement time is higher than other types of actions. Corrective maintenance normallycosts relatively more time than preventive maintenance. The maintenance time isseparated into fixed maintenance time and maintenance time related to maintenance depth. Fixed maintenance time is the time cost by basicactions such as disassembling, installing, lubricating, and adjusting, and the length of fixed time is assumed to be constant. During one maintenance, the more money and time that arespent, the better the maintenance effect.

The time cost for component s during the kth maintenance is ${{T}_{s}}_{,k}\left( {{l}_{s}}_{,k} \right)$:

${{T}_{s}}_{,k}\left( {{l}_{s}}_{,k} \right)=\left\{ \begin{align} & 0;{{l}_{s}}_{,k}=0 \\ & {{t}_{s}}_{,k}({{l}_{s}}_{,k});1\le {{l}_{s}}_{,k}\le {{p}_{s}}-2 \\ & {{t}_{s,pr}};{{l}_{s}}_{,k}={{p}_{s}}-1 \\ & {{t}_{s,cr}};{{l}_{s}}_{,k}={{p}_{s}} \\ \end{align} \right.$

In the equation, ${{l}_{s}}_{,k}$ is the code of the kth maintenance action for component s. If ${{l}_{s}}_{,k}=0$, no maintenance is selected and no time will be spent; if $1\le {{l}_{s}}_{,k}\le {{p}_{s}}-2$, minimal repair or imperfect maintenance is selected, and ${{t}_{s}}_{,k}({{l}_{s}}_{,k})$ is the maintenance time determined by maintenance depth; if ${{l}_{s}}_{,k}={{p}_{s}}-1$, preventive replacement is chosen and ${{t}_{s,pr}}$ is the time consumed; if ${{l}_{s}}_{,k}={{p}_{s}}$, corrective maintenance is chosen and ts,cr is the corresponding time.

During one task interval, the overall maintenance time can be calculated with Equation (13), and the kth maintenance time T(k) is:

$T\left( k \right)=\sum\limits_{s=1}^{N}{{{T}_{s}}_{,k}\left( {{l}_{s}}_{,k} \right)}$

In the equation, N=$\sum\nolimits_{i=1}^{m}{{{n}_{i}}}$, so N is the sum of the maintenance time spent on each component referred.

3.2. Objective Function and the Solving Algorithm

Assuming that all components are newand according to the aim determined before, the objective is to maximize the task reliability during the following episode. To denoted the gap time left for the kth maintenance by Mk, the objective function is:

$\max \left( R(k) \right)=\max \left( \prod\limits_{i=1}^{m}{\left( 1-\prod\limits_{j=1}^{{{n}_{i}}}{\left( 1-{{R}_{j}}_{,k}(k) \right)} \right)} \right)$
$\sum\limits_{s=1}^{N}{{{T}_{s}}_{,k}\left( {{l}_{s}}_{,k} \right)}\le {{M}_{k}}$

Equation (14)aims to maximize the reliability at the beginning of the next mission after the kth maintenance, and Equation (15) is set to make sure the summed maintenance time is less than Mk.

At the same time, the chosen action for each maintenance subject should be a feasible solution related to the observed real-time condition. The constraints about the feasible solutions are listed in Table 2.

Table 2.   Feasible maintenance actions according to condition of parts s

Ys(k){0, 1}0{0, 1}{0, 1}{0, 1}10
l s(k)012ps-2ps-1ps
Xs(k+1){0, 1}111111

New window| CSV


In Table 2, each available value of ls(k) is feasible only when the value of Ys(k) belongs to the set listed in the table. Taking the second column forexample, ls(k)=1 is feasible only when Ys(k)=0. It is easy to understand that minimal repair can be selected only if the component is in fault. After maintenance, the component can be turned into a functional state. The constraints shown in Table 2 are necessary to avoid unreasonable decisions.

According to the model proposed above, the regular linear programming method is running short of dealing with multiple real-time conditions and constraints, so it is necessary to prefer intelligent optimization algorithms thatare more adaptive and have stronger portability. The common intelligent optimization algorithms are the genetic algorithm and the particle swarm algorithm. The genetic algorithm is selected to solve the model proposed above.

As illustrated in section 1, the maintenance action set for every component is {0,1,2, , ps}, and each time the decision-making chooses one code from the set. According to the feature, a genetic chromosome with length of N is constructed, and each position stores the maintenance action code for one appointed component in the system. Therefore, the range of each position in the chromosome is the set {0,1,2, , ps}. According to the definition, the binary or real number coding measures are not feasible, so it is necessary to design a special code to perform crossover and mutation of the chromosome, so that the chromosomes generated from the last generation can be feasible [14].

The solving flow of the decision-making optimization modelis presented in Figure 3.

As shown in Figure 3, the components’ age are all 0 and the system is in perfect condition at the beginning. To push forward simulation time until the end of the current task, the equivalent age of all the components can be updated and the state of each component is determined randomly. By inputting the characteristic parameters into the genetic algorithm model, the best solution for the system can be solved. To perform the scheduled best maintenance plans and update the state of components, the simulation time can be pushed forward, and the decision-making process can be performed again. When the preset conditionis met or the simulation time is reached, the simulation should be terminated.

4. Case Study

To verify the sequential optimal selective maintenance decision-making model, a mechanical system is taken as the subject for case study. The structure of the system is shown as Figure 4.

Figure 4

Figure 4.   Block diagram of one system


As shown in Figure 4, the system is composed of three subsystems connected in series, and each subsystem has different components. The reliability function and parameters related to maintenance are listed in Table 3.

Table 3.   Related parameters of parts in one system (¥100, day)

No.βsαslscs,m(ls)Ts,k(ls,k)Noβsαslscs,m(ls)Ts,k(ls,k)
11.5300180.4052.52001100.30
2200.752300.55
3401.253400.90
4451.454451.15
5451.805451.60
22.4300160.4062.03751150.55
2200.652250.75
3351.003421.20
4401.454451.30
5401.755451.80
31.6250180.4071.24001100.60
2160.752260.80
3401.253451.40
4451.454481.60
5451.755481.90
42.4175190.5081.4400180.45
2250.752200.70
3381.253421.45
4401.454481.60
5401.755481.80

New window| CSV


Assume that the system is performing four tasks in series with time gap between tasks. Regardless of the mission number, Ok=100 days and Mk=6 days, and the value of p is also the same for every component,p=6. The condition updating process of the components in the system is simulated by the Monte Carlo simulation method. Along with the simulation steps, the optimal decisions are made for maintenance, and the conditions are updated accordingly. Due to the random properties of failures, selective maintenance should comply with the real-time situation. The state transition and corresponding maintenance decision-making result during one simulation process is shown in Table 4.

Table 4.   Selective maintenance decision-making output for one system (days)

k1234
B(k)[100,100,100,100,100,100,100,100][105.3,107.1,200,106.1,111.3,102.7,200,200][205.3,100,100,100,100,202.7,300,300][100,200,200,100,100,100,400,400]
Ys(k)[0,1,1,1,0,1,1,1][1,1,1,1,1,0,1,0][1,1,1,0,1,0,1,0]-
Y(k)111-
L(k)[4,4,1,4,4,4,1,1][1,5,5,5,5,1,1,1][5,1,1,4,4,6,1,1]-
Xs(k +1)[1,1,1,1,1,1,1,1][1,1,1,1,1,0,1,0][1,1,1,1,1,1,1,0]-
X(k +1)111-
T(k)5.65.55.4-
R(k +1)0.93650.94700.9276-

New window| CSV


In the table, k is the number of tasks, Ys(k) is the state vector after the kth task, L(k)is the optimal maintenance decision code vector, T(k) is the maintenance time used for the kth maintenance, Xs(k+1) is the state of component s at the beginning of the (k+1)th task, and R(k +1) is the expected task reliability in the (k+1)thtask.

As shown in Table 4, given the real-time age and state of the system, the optimized maintenance decisions L(k)are made accordingly using the model proposed in the paper, and the task reliability of the next mission episode can reach 0.9365, 0.9470, and 0.9276 respectively. Given the task interval as 6 days, each maintenance cost 5.6 days, 5.5 days, and 5.4 days, so the constraints are all met.

Theoretically, imperfect maintenance can offermore options for decision makers by supplying more combined maintenance decisions at the component level, so the reliability can be promoted. To analyze the effect of imperfect maintenance on the whole system, the imperfect maintenance actions are eliminated from the action set, so the available set is changed to {minimal repair, preventive replacement, corrective maintenance}. The simulation process is run while the other situations are the same. Set the task cycle number to 15 and the simulation repentant times 40. The result is shown in Figure 5.

Figure 5

Figure 5.   The effect on mission reliability of system with or without imperfect maintenance


As shown in Figure 5, maintenance with imperfect maintenance pushes the reliability relative higher, and when the gap between the two curves turns stable, the precise distance is near 0.03. The comparison proved that imperfect maintenance can enrich the decision-making spaces and make the task reliability higher.

If the time and cost constraints do not exist, all the components can be replaced so that the reliability can be kept at the ideal level. In the case, the reliability can reach 0.9558, which means that all task reliability can be kept to 0.9588 regardless of the cycle number. If the gap time between tasks is shortened, the time left for maintenance will be limited and the decision-making space will be constrained. The less time that is left for repair, the lower the chance to perform deeper maintenance, and the task reliability will be lowered as a result. To verify the hypothesis, the related parameter is changed and the simulation process is run multiple times. The task cycle numberis set to 10 and simulation times 40. The reliability of the system is shown in Figure 6.

Figure 6

Figure 6.   The reliability curves of the system under selective maintenance given different maintenance time threshold


It is shown in Figure 6 that along with the shortened maintenance interval, the descend trend of reliability will be more and more obvious. When Mk∈{6, 7, 8}, the task reliability can turn stable gradually above 0.86 with the accumulation of task cycles. When Mk≤5, the reliability will drop more rapidly, and when Mk=3, the 10th task reliability will drop to 0.5275 and the task will be difficult to perform. The simulation result can offer information from a different aspect. If the reliability threshold is 0.85, then the maintenance interval length should be at least above 6.

The age reduction factor and correction parameter introduced in Equation (1) can help reflect the real situation with more accuracy. To analyze the effect of the two factors, eliminate one of the two factors. An age reduction model is gained by eliminating the correction parameter, and a risk correction model is gained by elimination of the age reduction factor. The comparison result is shown in Figure 7.

Figure 7

Figure 7.   The mission reliability of system under different imperfect maintenance model


The combined model proposed in the paper does not reduce the age back to zero, and the flawed maintenance chance is also depicted by the correction parameter. Compared with the other two models, this model should be lower at a given time node. The curves in Figure 6 verified the hypothesis, and in this case, the gap between the proposed model and the other two are between 0.02 and 0.04, so it is reasonable to believe that the contribution of the two factors is considerable. In practice, if the two factors do exist, the proposed model in the paper should be applied so that the reliability would not be optimistically estimated in excess, or else the execution of the task might be affected due to the lack of preparation.

5. Conclusions

To better demonstrate the effect of maintenance and help make more practical selective maintenance decisions, the influence of imperfect maintenance on the system is analyzed. A decision-making model aiming at the maximization of task reliability is proposed considering the time constraints. The case study result showed that the introduction of imperfect maintenance is helpful for offering more feasible solutions so that the reliability can be promoted.

As for complex systems such as military equipment, during the execution process of missions, the selective maintenance decision-making is constrained not only by time but also by spares, tools, and so on, so more complicated cases will be further researched.

Reference

Q. Z. Zheng, L. M. Guo, H. P. Shi, N. Wang , “

Selective Maintenance Problem for Series-Parallel System under Economic Dependence

,” Defence Technology, Vol.12, No. 5, pp. 388-400, 2016

DOI:10.1016/j.dt.2016.04.004      URL     [Cited within: 3]

In view of the high complexity of the objective world, economic dependence between subsystems (paired and unpaired) is proposed, and then the maintenance cost and time under different economic dependence are formulated in a simple and consistent manner. Selective Maintenance Problem under Economic Dependence (EDSMP) is presented based on series-parallel system in this paper. A case study shows that the system reliability is promoted to a certain extent, which can validate the validity of EDSMP model. Then the influence of the ratio of set-up cost on system performance is mainly discussed under different economic dependence. In order to solve a large sized EDSMP rapidly, several existing improvements of classical exhaust algorithm are further modified. Experiment results illustrate that these improvements can reduce CPU time significantly. Furthermore the contribution of each improvement is defined here and then their contributions are compared thoroughly.

W.B. Liu, S. H. Wang, X. H. Meng, Wu Chen ,“

Equipment Maintenance Task Scheduling based on Genetic Algorithm

,” Ordnance Industry Automation, Vol.29,No. 11, pp. 21-26, 2010

[Cited within: 1]

F. M. Liu, H. P. Zhu, B. X. Liu , “

Maintenance Decision-Making Method for Manufacturing System based on Cost and Arithmetic Reduction of Intensity Model

,” Journal of Central South University, Vol. 20, No. 6, pp. 1559-1571, 2013

DOI:10.1007/s11771-013-1648-y      URL    

A cost-based selective maintenance decision-making method was presented. The purpose of this method was to find an optimal choice of maintenance actions to be performed on a selected group of machines for manufacturing systems. The arithmetic reduction of intensity model was introduced to describe the influence on machine failure intensity by different maintenance actions (preventive maintenance, minimal repair and overhaul). In the meantime, a resolution algorithm combining the greedy heuristic rules with genetic algorithm was provided. Finally, a case study of the maintenance decision-making problem of automobile workshop was given. Furthermore, the case study demonstrates the practicability of this method.

Y. Liu, Y. M. Chen, T. Jiang , “

On Sequence Planning for Selective Maintenance of Multi-State Systems under Stochastic Maintenance Durations

,” European Journal of Operational Research, Vol. 268, No. 1, pp. 113-127, 2018

DOI:10.1016/j.ejor.2017.12.036      URL     [Cited within: 1]

In many industrial and military environments, systems are required to execute a sequence of missions with a finite break between two adjacent missions. Due to the limited maintenance resources, such as budget, time, and manpower, etc., it is oftentimes impossible to perform all the desirable maintenance actions in the break. In such circumstance, selective maintenance is able to identify a subset of feasible maintenance actions to be conducted, so as to guarantee the success of the next mission. In this paper, a new selective maintenance model for multi-state systems is developed to maximize the probability of a system successfully completing the next mission, while taking account of the stochasticity of the durations of breaks and maintenance actions. Due to the presence of these duration uncertainties, it necessitates (1) choosing a subset of maintenance actions from all the optional maintenance actions, and (2) planning a sequence of selected maintenance actions to be performed. The saddlepoint approximation is utilized to facilitate the computation of the involved multi-dimensional integration in evaluating the probability of a system successfully completing the next mission. The resulting constrained combinational optimization problem is resolved by a tailored ant colony optimization algorithm. A numerical example of a three-unit multi-state system, together with an illustrative example of a multi-state coal transportation system, is presented to examine the effectiveness of the proposed method.

R. E. Wildeman, R. Dekker, A. C. J. M. Smit , “

A Dynamic Policy for Grouping Maintenance Activities

,” European Journal of Operational Research, Vol.99, No. 3, pp. 530-551, 1997

DOI:10.1016/S0377-2217(97)00319-6      URL     [Cited within: 1]

A maintenance activity carried out on a technical system often involves a system-dependent set-up cost that is the same for all maintenance activities carried out on that system. Grouping activities thus saves costs since execution of a group of activities requires only one set-up. Many maintenance models consider the grouping of maintenance activities on a long-term basis with an infinite horizon. This makes it very difficult to incorporate short-term circumstances such as opportunities or a varying use of components because these are either not known beforehand or make the problem intractable. In this paper we propose a rolling-horizon approach that takes a long-term tentative plan as a basis for a subsequent adaptation according to information that becomes available on the short term. This yields a dynamic grouping policy that assists the maintenance manager in his planning job. We present a fast approach that allows interactive planning by showing how shifts from the tentative planning work out. We illustrate our approach with examples.

X. Yao, M. Fu, S. I. Marcus , et al., “

Optimization of Preventive Maintenance Scheduling for Semiconductor Manufacturing Systems: Models and Implementation

,” in Proceedings of the 2001 IEEE International Conference on Control Applications (CCA’01), pp. 407-411, Mexico City, Mexico, 5-7, September 2001

DOI:10.1109/CCA.2001.973899      URL     [Cited within: 1]

Preventive maintenance (PM) is a vital activity in semiconductor manufacturing. A good PM schedule can increase the availability of tools by trading off between the planned unproductive down time versus the risk of much costlier unscheduled down time due to tool failures. Cluster tools are highly integrated systems made up of several processing modules (chambers) mechanically linked together, which can perform a sequence of semiconductor manufacturing processes. We present a two-layer hierarchical modeling framework for addressing the PM optimization problem for cluster tools, i.e., a Markov decision process (MDP) model at the higher level, and a mixed linear programming (LP) model at the lower level. Production planning data such as WIP levels are incorporated in these models. The LP model is solved using optimization packages EasyModeler and OSL. A case study comparing the results with a reference schedule is conducted in the simulation environment AutoSched AP, and numerical results are reported

C.R. Cassady, W.P. Murdock, E.A. Pohl , “

Selective Maintenance for Support Equipment Involving Multiple Maintenance Actions

,” European Journal of Operational Research, Vol.129, No. 2, pp. 252-258, 2001

DOI:10.1016/S0377-2217(00)00222-8      URL     [Cited within: 1]

Selective maintenance is the process of identifying a subset among sets of desirable maintenance actions. Previous works use mathematical programming models for making selective maintenance decisions for production equipment and military vehicles, which perform sequences of missions and are repaired only between missions. In this paper, extensions of these models are proposed. First, system component life is assumed to follow Weibull distributions. Second, the decision-maker is given multiple maintenance options: minimal repair on failed components, replacement of failed components, and replacement of functioning components (preventive maintenance).

M. Samrout, F. Yalaoui, E. Chaˆtelet , “

New Methods to Minimize the Preventive Maintenance Cost of Series-Parallel Systems Using Ant Colony Optimization

,” Reliability Engineering and System Safety, Vol. 89, No. 3, pp. 346-354, 2005

DOI:10.1016/j.ress.2004.09.005      URL     [Cited within: 2]

This article is based on a previous study made by Bris, Ch09telet and Yalaoui [Bris R, Chatelet E, Yalaoui F. New method to minimise the preventive maintenance cost of series–parallel systems. Reliab Eng Syst Saf 2003;82:247–55]. They use genetic algorithm to minimize preventive maintenance cost problem for the series–parallel systems. We propose to improve their results developing a new method based on another technique, the Ant Colony Optimization (ACO). The resolution consists in determining the solution vector of system component inspection periods, T P. Those calculations were applied within the programming tool Matlab. Thus, highly interesting results and improvements of previous studies were obtained.

K.S. Moghaddam and J. S. Usher , “

A New Multi-Objective Optimization Model for Preventive Maintenance and Replacement Scheduling of Multi-Component Systems

,” Engineering Optimization,Vol.43,No. 7, pp. 701-719,2011

DOI:10.1080/0305215X.2010.512084      URL     [Cited within: 1]

In this article, a new multi-objective optimization model is developed to determine the optimal preventive maintenance and replacement schedules in a repairable and maintainable multi-component system. In this model, the planning horizon is divided into discrete and equally-sized periods in which three possible actions must be planned for each component, namely maintenance, replacement, or do nothing. The objective is to determine a plan of actions for each component in the system while minimizing the total cost and maximizing overall system reliability simultaneously over the planning horizon. Because of the complexity, combinatorial and highly nonlinear structure of the mathematical model, two metaheuristic solution methods, generational genetic algorithm, and a simulated annealing are applied to tackle the problem. The Pareto optimal solutions that provide good tradeoffs between the total cost and the overall reliability of the system can be obtained by the solution approach. Such a modeling approach should be useful for maintenance planners and engineers tasked with the problem of developing recommended maintenance plans for complex systems of components.

M. Pandey, M. J. Zuo, R. Moghaddass , et al., “

Selective Maintenance for Binary Systems under Imperfect Repair

,” Reliability Engineering and System Safety, Vol. 113, pp. 42-51, May 2013

DOI:10.1016/j.sess.2012.12.009      URL     [Cited within: 1]

In many industrial environments like manufacturing systems, military equipments, power generation systems, etc., system maintenance is performed between successive missions. Different maintenance options (do nothing, minimal repair, preventive maintenance options or system overhaul, etc.) are possible for components in the system. However, it may not be feasible to do all possible maintenance actions during the maintenance break. Hence, optimal maintenance decision is required such that available resources are optimally used to maximize the next mission reliability. In this paper, a mathematical model is used to help in decision making for selective maintenance under imperfect repair. The level of maintenance actions determines the improvement in the component health. A model is formulated to relate the amount of resources used for maintenance to the level of imperfect repair. Further, a characteristic constant is used which determines the component response to resource consumed by a maintenance task. Selective maintenance model is formulated and illustrative examples are used to demonstrate the applicability and advantages of the proposed method. The results show that introduction of imperfect repair facilitates better allocation of maintenance resources. (C) 2012 Elsevier Ltd. All rights reserved.

C. Diallo, U. Venkatadri, A. Khatab, and Z. J. Liu , “

Optimal Selective Maintenance Decisions for Large Serial k -out-of- n: G Systems under Imperfect Maintenance

,” Reliability Engineering and System Safety,Vol. 175, pp. 234-245, July 2018

[Cited within: 1]

M. Pandey, M.J. Zuo, R. Moghaddass , “

Selective Maintenance Scheduling over a Finite Planning Horizon

,” Journal of Risk and Reliability, Vol. 230,No. 2, pp. 162-177, 2016

[Cited within: 3]

P.E. Labeau and M. C. Segovia , “

Effective Age Models for Imperfect Maintenance

,” Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, Vol. 225, No. 2, pp. 117-130,2011

[Cited within: 1]

W. B. Cao, X. S. Jia, Q. W. Hu, X. J. Su , “

Equipment Battlefield Repair Decision-Making Modelling based on Selective Maintenance

,” System Engineering and Electronics, Vol.40, No. 1, pp. 98-105, 2018

[Cited within: 1]

/