Introduction

Mechanical systems are employed in numerous applications, such as power plant, aviation and manufacturing. These demand higher availability for economic considerations. The analysis of availability guides practicing engineers in selecting an appropriate maintenance strategy and in improving performance of the system (Kumar et al. 2009).

In the past, researchers have focused towards development of time-based maintenance models (Crocker and Kumar 2000). Preventive maintenance (PM) is the scheduled maintenance that includes actions such as; adjustments, inspection, lubrication and replacement of components (Sim and Endrenyi 1988). Ahmad et al. (2011) proposed a maintenance decision model for PM application. Charles-Owaba et al. (2008) suggested scheduling of the PM based on opportunistic cost. Though PM does help in avoiding the equipment breakdowns, but it no way fulfills maintenance objectives by not utilizing optimum use of maintenance resources. The replacement interval of components and lube oils under PM is conservative, and this result in their replacement, with sufficient residual life still left. To take care of this concern, CBM policy came up. Under this; a planned maintenance action, is undertaken, i.e., not timely based but condition based. In CBM, condition-monitoring (CM) techniques such as vibration, acoustic emission, thermography and oil and wear debris analysis are used to assess health of the system (Wang 2008).

Most of the mechanical systems experience gradual degradation. It is appropriate to consider multiple states of the considered mechanical system or component, instead of the binary states for availability analysis (Majid and Nasir 2011). Van et al. (2012) studied maintenance policy with stochastic degradation of equipment. In degradation models; the states are decided, in general, based on the real-time health of the system. Wang et al. (2010) proposed a multi-degrading states model and considered the periodic inspection at each degraded state with an appropriate maintenance action.

Condition-based maintenance modeling for mechanical systems has been reviewed by various researchers (Jardine et al. 2006; Pandian and Ali 2009) with noticeable contributions from Chen and Trivedi (2005); Carr and Wang (2011). However, the transition distributions for degradation, repair and inspection are considered exponential, which is not always applicable. Amari and McLaughlin (2004) and El-Damcese and Temraz (2011) demonstrated the analysis of a multi-state system using Markov reward model and Markov chain, respectively. Ahmad et al. (2017) suggested a simulation-based optimization approach for free distributed repairable multi-state availability-redundancy allocation problems. Semi-Markov process approach is, however, capable to handle non-exponential distributions. But these have been attempted for limited applications such as software (Xie et al. 2005), NC machine tool (Qiang et al. 2010) and opportunistic maintenance (Kumar et al. 2014).

Although extensive work has been carried out under CBM, yet little attention has been paid to availability modeling of systems with CBM maintenance (Khanduja et al. 2011). Moreover, the frequency of CM interval affects the system availability and the literature shows that there is limited work on optimization of CM interval. In this paper, SMP modeling of mechanical systems, with multi-state degradation and using CBM, is proposed for the steady-state availability analysis.

The paper is organized, with system modeling described in the next Section. In Sect. 3, steady-state availability analysis is presented, while in Sect. 4, optimization of CM interval using GA is suggested and its methodology is described in Sect. 5. In Sect. 6, the proposed methodology is illustrated by an example and the last section, i.e., Sect. 7, concludes the paper.

System modeling

Condition-monitoring (CM) of the system is getting easier day-by-day, with recent advancements in sensor and real-time data capturing technologies. This has indeed helped to implement CBM in the plants in an effective way. In this work, a methodology for system availability assessment is developed, incorporating the CBM. The degradation behavior of the mechanical systems, together with periodic CM and their maintenance causes the stay time of their states that follow non-exponential distribution (Fricks and Trivedi 1997; Dennis 2003). The system model, therefore, is developed using the SMP, rather than a Markov model.

Modeling degradation, random failures and condition monitoring

In this subsection, three modeling aspects; degradation, random failures and periodic condition monitoring are considered. A SMP model of a mechanical system is developed employing the three features and is shown in Fig. 1.

Fig. 1
figure 1

System SMP model—CBM

Multi-degraded states with Weibull distribution are appropriate for developing the system model (Jager and Bertsche 2004). Let D i , be a consecutive degraded state with \(i\,\in\,\{ 1,2,3, \ldots ,n\}\). Every degraded state, D i , is identified using an appropriate CM metric, with lower and upper bounds; l i and u i. It is assumed that there is gradual system degradation; with the degradation rate slow initially, which increases with time.

Application of the CBM for a system does rule out the occurrence of its random failure. But this has been considered in this work to take care of an unforeseen case, i.e., the system may fail randomly in spite of being under CM. The random failures are modeled with exponential distribution and may occur at any stage of degradation. A random failure in the model, Fig. 1, is shown by connecting the degraded state, D i , to random failure state, F r by a directed line or edge, with direction from node D i to node F r . It may be mentioned that the system is brought back to its first state, D 1, by an appropriate repair action and the lognormal distribution is considered for such repairs (Dennis 2003).

In principle, the CM interval between two consecutive CM checks should be longer in the initial degraded states, while it should be shorter in the subsequent and high degradation states. Therefore, CM intervals; T 1, T 2, T 3, …, T n , for the respective degraded states are considered in the decreasing order. Let D xi , be the ith degraded state for CM metric, x i , with \(l_{i} \le x_{i} \le u_{i}\). The system may iterate within the same degraded state, D i , and within its metric range, by adopting or following the minimal repair. However, as the system ages, it moves to the next degraded state. The time to perform CM at a degraded state is assumed to follow an exponential distribution.

Modeling various repair actions

The decision whether to undertake maintenance or maintain the status quo, is taken based on the condition of the system. In case the system health is normal and does not show deterioration from the CM metric check, the decision is ‘no repair’ and the system is allowed to operate. Otherwise, an appropriate maintenance action such as: minimal, imperfect or major repair is carried out to bring back the system to its current, previous better or the initial state, respectively.

In the system SMP model, Fig. 1, minimal repair is considered for all the degraded states, i.e., mi j ,\(j \in \{ 1,2,3, \ldots ,n\} ,\) while major repair is considered for all degraded states except the first degraded state, i.e., ma k , \(k \in \{ 2,3, \ldots ,n\}\) and imperfect repair is considered at all degraded states, except the first and second degraded states, i.e., im r p , \(p \in \{ 3, \ldots ,n\}\) and r = 1, 2, 3,…, (p-2). It is well known that a minimal repair takes, in general, the least time, while the imperfect repair takes more time than the minimal repair, but a lesser time than a major repair. Moreover, the time of repair will be higher, if the repair is carried out at a highly degraded state. The lognormal distribution, being more appropriate for repair of mechanical systems, is employed in the model (Dennis 2003).

The SMP system model, Fig. 1, is developed by incorporating the aspects discussed in this section. A solution procedure of the model for the system availability analysis is described in the next section.

Steady-state availability analysis

This section deals with steady state availability analysis based on the SMP system model in Sect. 2 and using analytical solution described in the following subsection.

Analytical solution of the SMP model

A two-stage method which is easy to implement, is selected for steady-state solution of the SMP model (Xie et al. 2005). In the two-stage method; Embedded Markov chain (EMC) of SMP that is a discrete time Markov chain (DTMC), is used to simplify the analysis of the SMP. Stage 1, deals with evaluation of the one-step transition probability matrix of Embedded Markov Chain of the SMP model, which is used to obtain steady-state probabilities of the EMC. In stage 2, the sojourn (stay) time of each state in a SMP model is evaluated and its steady-state probability is obtained using the values of the steady-state probabilities of the EMC (obtained from stage 1) and its sojourn time value. The procedure for both the stages is detailed in the following subsections.

Stage 1: steady-state probabilities of EMC

Refer Fig. 1 for the system SMP model, which consists of the state space, \(\varOmega\), represented as:

$$\Omega = \left\{ {\left. {D_{1} , \ldots ,D_{n} ;\quad F_{r} ;\quad D_{{x_{1} }} , \ldots ,D_{{x_{n} }} ;\quad mi_{1} , \ldots ,mi_{n} ;\quad im_{3}^{1} , \ldots ,im_{n}^{n - 2} ;\quad ma_{2} , \ldots ,ma_{n} } \right\}} \right.$$

The Semi-Markov Process model is expressed in terms of kernel matrix, K(t), which is given as:

(1)

The elements, k ij (t) of the matrix, K(t), as given by Kulkrani (2009) are redefined as:

$$k_{ij} \left( t \right) = \left\{ {\begin{array}{*{20}l} 0 \hfill &\begin{aligned} {:{\text{when}}\;{\text{transition}}\;{\text{is}}\;{\text{not}}\;{\text{possible}}\;{\text{from}}\;{\text{the}}\;{\text{ith}}\;{\text{state}}\;{\text{within}}\;{\text{the}}\;{\text{time }}t} \hfill \\ \end{aligned} \hfill \\ {F_{ij} \left( t \right)} \hfill & \begin{aligned} :{\text{when}}\;{\text{only}}\;{\text{one}}\;{\text{state j is reachable from the ith state (excluding the}} \hfill \\ {\text{CM}}\;{\text{states)}}\;{\text{within}}\;{\text{the}}\;{\text{time }}t \hfill \\ \end{aligned} \hfill \\ {\int\limits_{0}^{t} {\overline{F}_{ik} \overline{F}_{im} {\text{d}}F_{ij} \left( x \right)} }\hfill & \begin{aligned} :{\text{when}}\;{\text{two}}\;{\text{or}}\;{\text{more}}\;{\text{states}}\; ( {\text{for}}\;{\text{example;}}\;{\text{three}}\;{\text{states}}\;{\text{viz}}. \, j, \, k\,{\text{and }}m) \hfill \\ {\text{are}}\;{\text{reachable}}\;{\text{from}}\;{\text{the}}\;{\text{ith}}\;{\text{state}}\; ( {\text{excluding the CM state)}}\;{\text{within}}\;{\text{the}}\;{\text{time }}t \hfill \\ \end{aligned} \hfill \\ {p_{j} F_{i} } \hfill & \begin{aligned} : {\text{when}}\;{\text{more}}\;{\text{than}}\;{\text{one}}\;{\text{state }}({\text{i}} . {\text{e}} . {\text{ degraded state and possible}} \hfill \\ {\text{ maintenance}}\;{\text{states)}}\;{\text{reachable}}\;{\text{from}}\;{\text{the}}\;{\text{CM}}\;{\text{state }}i,{\text{ i}} \in \{ D_{x1} ,D_{x2} , \ldots ,D_{xn} \} \hfill \\ {\text{within}}\;{\text{time}}\;{\text{t}} \hfill \\ \end{aligned} \hfill \\ \end{array} } \right.$$
(2)

The Kernel matrix, K(t), Eq. (2), is used to evaluate one-step transition probability matrix, Z = K(\({\infty }\)), of the EMC of the SMP by considering \(t \to {\infty }\). Let the elements of the matrix, Z, be p ij , with i, j = 1–N. To evaluate these elements, there is an additional condition that for each row, the sum of elements of K(t) becomes 1, as \(t \to {\infty }\), i.e., \(\it \sum\nolimits_{j = 1}^{N} { p_{ij}= 1}\) for all i = 1–N. Since these elements involve complicated integrals for the chosen CDF, these can be solved with the help of a software like Maple. The one-step transition probability matrix, Z, is given as (Kulkrani 2009):

$$Z = K({\infty }) = \left[ {\begin{array}{*{20}c} {p_{11} } & {p_{12} } & {p_{13} } & \ldots & \ldots & {p_{1N} } \\ {p_{21} } & {p_{22} } & {p_{23} } & \ldots & \ldots & {p_{2N} } \\ {p_{31} } & {p_{32} } & {p_{33} } & \ldots & \ldots & {p_{3N} } \\ \ldots & \ldots & \ldots & \ldots & \ldots & \ldots \\ \ldots & \ldots & \ldots & \ldots & \ldots & \ldots \\ {p_{N1} } & {p_{N2} } & {p_{N3} } & \ldots & \ldots & {p_{NN} } \\ \end{array} } \right]$$
(3)

The following system of linear equations is formulated to find the steady state probabilities of the EMC, \(h_{i} ,i{ \in \varOmega }\), (Kulkrani 2009).

$$H = HK({\infty }),\quad \sum\limits_{i = 1}^{N} {h_{i} = 1,i{ \in \varOmega }}$$
(4)

where \(H = \left[ {h_{1} ,h_{2} , \ldots ,h_{N} } \right]\) is the steady state probability matrix of the EMC and \(K({\infty })\) is the Kernel matrix when \(t \to {\infty }\).

The system of linear Equations, i.e., Eq. (4), can be solved by software such as Matlab. The steady state probabilities of the EMC, \(h_{i} ,\,i{ \in \varOmega }\), are obtained, and these values are used for evaluating steady state probability, \(P_{i} ,\,i{ \in \varOmega }\) of the SMP of state i, in stage 2.

Stage 2: steady-state probabilities of states in SMP

In stage 2, the mean sojourn time, \(\tau_{i}\), i.e., the time the process spends at state i is evaluated to obtain the steady-state probability of state i, i.e.; P i . The mean sojourn time, \(\tau_{i}\), is obtained using the following definition (Kulkrani 2009):

$$\tau_{i} = \left\{ {\begin{array}{*{20}l} 0 \hfill & \begin{aligned} :{\text{when}}\;{\text{transition}}\;{\text{is}}\;{\text{not}}\;{\text{possible}}\;{\text{from}}\;{\text{the}}\;{\text{ith}}\;{\text{state within}} \hfill \\ {\text{the}}\;{\text{time}}\;t \hfill \\ \end{aligned} \hfill \\ {\int\limits_{0}^{{\infty }} {\bar{F}_{ij} (t){\text{d}}t} } \hfill & \begin{aligned} :{\text{when}}\;{\text{only}}\;{\text{one}}\;{\text{state}}\;j\;{\text{is}}\;{\text{reachable}}\;{\text{from}}\;{\text{the}}\;{\text{ith}}\;{\text{state}} \hfill \\ ({\text{excluding}}\;{\text{the}}\;{\text{CM}}\;{\text{states}})\;{\text{within}}\;{\text{the}}\;{\text{time}}\;t \hfill \\ \end{aligned} \hfill \\ {\int\limits_{0}^{{\infty }} {\overline{F}_{ij} \bar{F}_{ik} \bar{F}_{im} (t){\text{d}}t} } \hfill & \begin{aligned} :{\text{when}}\;{\text{two}}\;{\text{or}}\;{\text{more}}\;{\text{states}}\; ( {\text{for}}\;{\text{example;}}\;{\text{three}}\;{\text{states}}\;{\text{viz}} .\;j,\;k \hfill \\ {\text{and}}\;m)\;{\text{are}}\;{\text{reachable}}\;{\text{from}}\;{\text{the}}\;i{\text{th}}\;{\text{state}}\;({\text{excluding}}\;{\text{the}}\;{\text{CM}} \hfill \\ {\text{state}})\;{\text{within}}\;{\text{the}}\;{\text{time}}\;t\;{\text{with}}\;{\text{three}}\;{\text{respective}}\;{\text{elements}}\;{\text{of}} \hfill \\ k(t)\;{\text{in}}\;{\text{the}}\;i{\text{th}}\;{\text{row}} \hfill \\ \end{aligned} \hfill \\ {\int\limits_{0}^{{\infty }} {\overline{F}_{{D_{{x_{i} }} }} {\text{d}}t} } \hfill & \begin{aligned} :{\text{when}}\;{\text{more}}\;{\text{than}}\;{\text{one}}\;{\text{state}}\; ( {\text{i}} . {\text{e}} .\;{\text{degraded}}\;{\text{state}}\;{\text{and}}\;{\text{possible}} \hfill \\ {\text{maintenance}}\;{\text{states)}}\;{\text{are}}\;{\text{reachable}}\;{\text{from}}\;{\text{the}}\;{\text{CM}}\;{\text{state}}\;i \hfill \\ i \in \left\{ {D_{x1} ,D_{x2} , \ldots ,D_{xn} } \right\}\;{\text{within}}\;{\text{time}}\;t \hfill \\ \end{aligned} \hfill \\ \end{array} } \right.$$
(5)

Using the values of steady state probabilities of the EMC and the sojourn time values, the steady state probability of state i, P i , for the SMP model is obtained as (Kulkrani 2009):

$$P_{i} = \frac{{h_{i} \tau_{i} }}{{\sum\limits_{{j{ \in \varOmega }}} {h_{j} \tau_{j} } }},\quad i{ \in \varOmega },$$
(6)

where \(h_{i}\) and \(\tau_{i}\) values are evaluated using Eqs. (4) and (5), respectively

If W is set of working/operating state, the steady state availability is given by:

$$A_{s} = \sum\limits_{{j \in W}} {P_{j} }$$
(7)

where, P j is obtained using the Eq. (6).

Optimization of CM interval using GA

A genetic algorithm (GA) solves complex optimization problems and it is based on the natural evolution process (Goldberg 2006). In this approach, population changes continuously through cross breeding, mutation and natural selection. An explicit mathematical formulation is not required in implementation and, the parameter values, such as; population size, crossover rate and mutation rate are appropriately chosen to maintain the desired accuracy in the solution. The main steps of GA approach are (Kuo et al. 2001):

  • Chromosome representation

  • Generation of initial population

  • Evaluation of fitness function

  • Selection process

  • Genetic operations (crossover, mutation)

  • Selection of best chromosomes according to the fitness values

  • Termination criteria

In this paper, the GA approach is applied to decide the optimal CM interval for maximizing the system availability. The availability function as per the procedure detailed in Sect. 3 is coded in Matlab and the developed code is used in the GA tool box for optimization.

A methodology based on the deliberations in Sects. 2, 3 and 4 is suggested for steady state system availability in the following section.

Step wise methodology: availability analysis

Steps for the steady-state availability analysis of the SMP model are presented below, which are based on the discussion in Sects. 2, 3 and 4.

Step I: system structure

Identify the components/subsystems in the selected system.

Step II: SMP modeling of the system

Derive feasible states for the system and evolve a SMP model (Refer Sect. 2).

Step III: component/subsystem failure and repair distribution

Identify the distribution and its parameter (s) for degradation/failure time, repair time, CM time interval and CM activity time at the component/subsystem level (Refer Sect. 2).

Step IV: two-stage steady state system availability analysis

  1. (a)

    Kernel matrix, K(t)

Derive the Kernel matrix, K(t), for the system model using the definition of its elements, Eq. (2).

  1. (b)

    One step transition probability matrix, Z, of the EMC

Generate one-step transition probability matrix, Z, of the EMC of the SMP model, using the step IV (a), with \(t \to {\infty }\).

  1. (c)

    Steady state probability of the states of EMC

Steady state probability of all states of EMC of the system SMP model, using Eq. (4).

  1. (d)

    Mean sojourn time of the states

Evaluate mean sojourn time of all states of the SMP model, using Eq. (5).

  1. (e)

    Steady state probability of states

Steady state probability of state i, P i , of the SMP model is obtained using the Eq. (6).

  1. (f)

    Availability evaluation

Using step IV (e), evaluate the system steady state availability by adding the steady-state probabilities of the working states in the system, i.e., Eq. (7).

Step V: optimization of CM interval

Evaluate optimum CM interval to maximize the system availability by Genetic Algorithm approach (Refer Sect. 4).

The methodology suggested above is illustrated in the next section.

Example

A centrifugal pump is selected for steady state availability assessment using the proposed methodology involving CBM model. Condition monitoring is applied for degradation/failure detection of the pump so that a maintenance action is taken well in time to avoid the failure of the pump and increase its availability. The suggested approach is demonstrated by following its step-by-step methodology given in Sect. 5.

Step I: system description

Pump system is considered. The centrifugal pump consists of six components, i.e., impeller, shaft, bearing, motor, bush, housing. To avoid the state space explosion problem, the states are defined at system level, i.e., at the pump level. The Semi-Markov model is developed for the system, i.e., the pump in the following step.

Step II: SMP model of the pump

Round the clock or continued operation of the pump can lead to its gradual deterioration. For the availability modeling, three degraded states are considered. Let these are: D 1, D 2 and D 3. A random failure state is designated as F r . It is assumed that CM is performed at scheduled periodic intervals of T 1 for state D 1, T 2 for state D 2 and T 3 for state D 3. Let the corresponding CM metric for these degraded states are \(D_{{x_{1} }} ,\) \(D_{{x_{2} }} ,\) and \(D_{{x_{3} }} .\). The maintenance activities are performed depending upon the condition of the pump. The minor repair is considered at each stage of degradation, with three minor repair states being \(mi_{1} ,\) \(mi_{2} ,\) and \(mi_{3} .\). Major repair states, \(ma_{2}\) and \(ma_{3}\), are considered at the second and third stage of degradation. An imperfect repair state \(im_{3}^{1}\) is envisaged at stage 3 of degradation. This is as per the discussion in Sect. 2.2.

Based on the above and referring Sect. 5.3, the SMP model is developed and is shown in Fig. 2. The state space for the model is given as:

$$\Omega = \left\{ {\left. {D_{1} ,D_{2} ,D_{3} ;F_{r} ;D_{{x_{1} }} ,D_{{x_{2} }} ,D_{{x_{3} }} ;mi_{1} ,mi_{2} ,mi_{3} ;im_{3}^{1} ;ma_{2} ,ma_{3} } \right\}} \right.$$
Fig. 2
figure 2

SMP model; CBM—Centrifugal pump

The steady state analytical solution of the SMP model requires the state transition time distributions and their parameters, which are identified in the next step.

Step III: state transition time distribution and parameters of the centrifugal pump

The state transition time distribution and parameters for the centrifugal pump are chosen based on literature and also the experience (Nel and Haarhoff 2011; Dennis 2003). The distribution and its parameter(s) for the time duration in each state are identified and are given in Table 1.

Table 1 Distribution and parameter values—Centrifugal pump

Step IV: two-stage method for steady state analysis of Centrifugal pump

There are two stages, i.e., stage 1 and stage 2. The stage 1 of the two-stage method is as below:

  1. (a)

    Kernel matrix, K(t)

The Semi-Markov model is expressed by its Kernel matrix, K(t) and their elements are calculated as per the method given in Sect. 3.1.1. The Kernel matrix K(t) for the pump is obtained and is given as the matrix, Eq. (8), shows its zero and other leftover non-zero elements, i.e., k ij (t).

(8)

The non-zero elements of the matrix, K(t), Eq. (8), are derived, using the distributions (Table 1) and Eq. (2), and these are listed in “Appendix 1”.

  1. (b)

    One step transition probability matrix, Z, of the EMC

The Kernel matrix K(t), Eq. (8), evaluates one-step transition probability matrix, Z = K(\({\infty }\)), of the EMC of the SMP, with \(t \to {\infty }\). Refer Sect. 3.1.1. The elements of matrix Z are evaluated with the condition that for each row, the summation of elements of K(t) is 1.

Using expressions of elements of the Kernel matrix, K(t), listed in “Appendix 1”, the elements of the matrix, Z are derived and these are tabulated in “Appendix 2”.

It may be mentioned that the Matlab software is employed to evaluate the expressions (Matlab Release 7.7 2010). The evaluated non-zero elements of the matrix, Z, are as listed in “Appendix 2”.

  1. (c)

    Steady state probability of the states of the EMC

The steady state probabilities of the EMC are evaluated using a set of Eq. (4) for the system data (Table 1).

For the model, the system of equations is:

$$\begin{aligned} \left[ {\begin{array}{*{20}c} {h_{{D_{1} }} } & {h_{{D_{2} }} } & {h_{{D_{3} }} } & {h{}_{{F_{r} }}} & {h_{{D_{{x_{1} }} }} } & {h_{{D_{{x_{2} }} }} } & {h_{{D_{{x_{3} }} }} } & {h_{{mi_{1} }} } & {h_{{mi_{2} }} } & {h{}_{{mi_{3} }}} & {h_{{im_{3}^{1} }} } & {h_{{ma_{2} }} } & {h_{{ma_{3} }} } \\ \end{array} } \right] = \hfill \\ \left[ {\begin{array}{*{20}c} {h_{{D_{1} }} } & {h_{{D_{2} }} } & {h_{{D_{3} }} } & {h_{{F_{r} }} } & {h_{{D_{{x_{1} }} }} } & {h_{{D_{{x_{2} }} }} } & {h_{{D_{{x_{3} }} }} } & {h_{{mi{}_{1}}} } & {h_{{mi_{2} }} } & {h_{{mi_{3} }} } & {h_{{im_{3}^{1} }} } & {h_{{ma_{2} }} } & {h_{{ma_{3} }} } \\ \end{array} } \right]\text{*}Z \hfill \\ \end{aligned}$$
(9)

This set of equations is solved using Matlab (Matlab Release 7.7 2010) and the values of \(h_{i} ,i{ \in \varOmega }\) are tabulated and given in Table 2.

Table 2 Steady state probability of the states of the EMC—CBM model
  1. (d)

    Mean sojourn time of the states of the centrifugal pump

Sojourn time values are evaluated for the stage 2 and these values are used for evaluation of steady state probabilities of system states. Sojourn time, \(\tau_{i}\), expressions are derived using Eq. (5) and using the distribution parameter value given in Table 1. These expressions are listed in “Appendix 3”. Using the set of expressions (“Appendix 3”) and the distribution and its parameter values, given in Table 1, the sojourn time for all states, involving complex integrals, is evaluated (Matlab Release 7.7 2010) and the same are listed in “Appendix 3”.

  1. (e)

    Steady state probability of states of the centrifugal pump

The steady state probability of state i, for the pump system, is evaluated using Eq. (6), and the values of steady state probabilities of EMC, \(h_{i}\), and the values sojourn times (\(\tau_{i}\)) as calculated above in step IV (c) and IV (d). The evaluated value of the steady state probability of states is given in Table 3.

Table 3 Steady state probability—CBM model
  1. (f)

    System steady state availability for the centrifugal pump

System steady state availability assessment of the pump system is obtained using Eq. (7), i.e.,

$$A_{\text{pump}} = \sum\limits_{j \in W} {P_{j} }$$

The set of working states of the system model (Fig. 2) is; \(W = \left\{ {\left. {D_{1} ,\begin{array}{*{20}c} {} \\ \end{array} D_{2} ,\begin{array}{*{20}c} {} \\ \end{array} D_{3} ,\begin{array}{*{20}c} {} \\ \end{array} D_{{x_{1} }} ,\begin{array}{*{20}c} {} \\ \end{array} D_{{x_{2} }} ,\begin{array}{*{20}c} {} \\ \end{array} D_{{x_{3} }} } \right\}} \right..\) Therefore, the availability is the sum of steady state probability of its working states, i.e.,

$$A_{\text{pump}} = P_{{D_{1} }} + P_{{D_{2} }} + P_{{D_{3} }} + P_{{D_{{x_{1} }} }} + P_{{D_{{x_{2} }} }} + P_{{D_{{x_{3} }} }}$$

The evaluated value of steady state availability is:

$$A_{\text{pump}} = 0.9971375783$$

The result obtained from the proposed model is in close agreement with the result (0.99970) following the same input data with different approach (Nel and Haarhoff 2011).

Step-V: optimization of CM interval using GA

The optimum CM interval to maximize the system availability is obtained by Genetic Algorithm approach—refer Sect. 4 for details. A code for availability following the above steps is written in Matlab and the availability function is called in the GA tool box of Matlab to find the optimum values of three CM intervals; CM intervals; T1, T2 and T3, and system availability, A. The results obtained are: T 1 = 9650 h; T 2 = 9600 h; T 3 = 9520 h and A = 0.999446816.

The results obtained are realistic and attributed to the SMP model, incorporating multi-state degradation, appropriate distribution for modeling random failures, repairs and CM interval. The suggested methodology is useful for maintenance engineers in selecting suitable maintenance policies in the plant to achieve the system availability goals. Also, designers can use the methodology to design mechanical systems for desired availability by introducing the appropriate repair and level of repair.

Conclusion

In this paper, condition-based maintenance model of mechanical systems are proposed for steady-state availability analysis using the SMP. The system model is developed considering multi-state degradation, using condition-based maintenance. In addition to degradation, random failures are also considered. Weibull, log-normal, exponential and deterministic distributions are considered for degradation, repair, random failure and periodic CM, respectively. It is demonstrated through a case study that condition-monitoring can significantly improve the system availability. Also, the optimum CM interval is determined for maximizing the system availability using Genetic Algorithm approach.

The proposed methodology is quicker than the simulation-based approaches since results are obtained in a single run. Moreover, the results are more accurate than the results obtained from simulation approach as these are obtained from closed form solutions. Since appropriate distributions for the failure and the repair time are used, the results obtained with suggested methodology are more realistic. The model can be manipulated under different set of parameter values to see the impact of various maintenance policies on system availability. The proposed methodology is useful for maintenance engineers in decision making, and directly helps them for devising suitable maintenance/replacement policies in the plant.