Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-05T04:28:13.329Z Has data issue: false hasContentIssue false

On the combined imperfect repair process

Published online by Cambridge University Press:  18 September 2023

Ji Hwan Cha*
Affiliation:
Department of Statistics, Ewha Womans University, Seoul, 120-750, Republic of Korea
Maxim Finkelstein
Affiliation:
Department of Mathematical Statistics, University of the Free State, Bloemfontein, 9300, South Africa Department of Management Science, University of Strathclyde, Glasgow, G40 4JR, Scotland
*
Corresponding author: Ji Hwan Cha; Email: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

In this paper, a new point process is introduced. It combines the nonhomogeneous Poisson process with the generalized Polya process (GPP) studied in recent literature. In reliability interpretation, each event (failure) from this process is minimally repaired with a given probability and GPP-repaired with the complementary probability. Characterization of the new process via the corresponding bivariate point process is presented. The mean numbers of events for marginal processes are obtained via the corresponding rates, which are used for considering an optimal replacement problem as an application.

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press.

1. Introduction

Stochastic point processes have been widely used in the reliability literature for modeling the processes of failures and repairs of repairable items. The most popular and the simplest repair in practical implementation is the perfect repair when an item is “good as new” after the repair (replacement). In what follows, for convenience, we will consider instantaneous repair; therefore, the processes of failure and repair coincide forming the renewal process in case of the perfect repair.

Let X denote the lifetime of an item described by its absolutely continuous cumulative distribution function (c.d.f.) F(t), the probability density function (p.d.f.) f(t), the failure rate $\lambda(t)$ and the survival function $\overline{F}(t)=1-F(t)$. The other type of repair that is widely used in practice is the minimal repair, introduced in Barlow and Hunter [Reference Barlow and Hunter6]. After the minimal repair, an item is in the “bad as old” state meaning that the distribution of its remaining lifetime is the same as just before the failure, that is,

(1)\begin{equation} F\left(t|x\right) =\frac{{\bar F}\left(x\right)-{\bar F}(x+t)}{{\bar F}(x)} = 1-\exp\left\{-\int_{x}^{x+t}\lambda\left(u\right)\,{\rm d}u\right\}, \end{equation}

where x is the time of failure/repair. It is well-known that the process of minimal repairs is described by the corresponding nonhomogeneous Poisson process (NHPP) with intensity function/rate $\lambda(t)$. Minimal repair is, obviously, already an imperfect repair.

Numerous models of imperfect repair has been reported in the literature (see, e.g., Badia and Berrade [Reference Badia and Berrade3Reference Badia and Berrade5], Navarro et al. [Reference Navarro, Arriaza and Suárez-Llorens16], Cha and Finkelstein [Reference Cha and Finkelstein11] and references therein). Note that, most of the papers deal with the intermediate case when the repair is better than minimal but worse than perfect. On the other hand, in practice, there are situations when the repair is worse than minimal. For example, often the failure of a component in a multicomponent system can increase stress, temperature, humidity, etc., which results in the increase in the overall failure rate of a system. Also, similar to debugging of software, the new “bugs” can be inserted during repair. See the relevant discussion and examples in Lee and Cha [Reference Lee and Cha14]. The generalized Polya process (GPP) introduced and characterized in Cha [Reference Cha9] is an efficient mathematical tool to model the worse than minimal repair (see the formal definition in the next section). This process generalizes the NHPP and its failure intensity/intensity process increases with each event.

In practice, however, at many instances, the type of repair is not predetermined and depends on the “properties” of each failure. The famous Brown-Proschan model [Reference Brown and Proschan8] was developed to deal with this randomness for a combination of minimal and perfect repair. Specifically, according to this model, each time an item fails, it is perfectly repaired with probability p and is minimally repaired with probability $(1-p)$. The Brown–Proschan model was extended by Block et al. [Reference Block, Borges and Savits7] to a model with an age-dependent probability p(t), where t is the time since the last perfect repair. This process can be simply characterized. For instance, the c.d.f. of the time between consecutive perfect repairs that form the corresponding renewal process, $F_{P}\left(t\right)$, is defined as

(2)\begin{equation} F_{P}\left(t\right) = 1-\exp\left\{-\int_{0}^{t }p\left(u\right)\lambda\left(u\right)\,{\rm d}u\right\}. \end{equation}

The goal of our paper is to consider a model similar to the Brown–Proschan model but with two imperfect repair options, that is, to combine in the described way the minimal and the GPP (worse than minimal) repairs. This model can be applied at many instances in practice, as some failures are easily minimally repaired, whereas others result in a worse than minimal repair. Therefore, it will define a new stochastic point process with each event (failure) minimally repaired with probability p(t) and GPP-repaired with the complementary probability $1-p(t)$.

This appears to be a much more difficult task, as we do not have renewal points now, and the stochastic intensity of this process is changing with each GPP event (it stays the same for minimal repairs). To do so, we will characterize the new combined repair process via introducing the relevant bivariate process and the pooled process, which is the sum of two marginal processes. It will be also shown that some relevant expected values for the events in the processes can be obtained in a simpler way considering not the stochastic intensities of processes but the corresponding intensity functions (rates). The latter is sufficient for considering, as an application, the optimal replacement problem: to find the optimal time of replacement (perfect repair) that minimizes the long-run cost rate.

The rest of the paper is organized as follows. In Section 2, we provide necessary definitions and descriptions. Section 3 is devoted to the characterization of the new bivariate counting process. In Section 4, we derive intensity functions of the processes of interest. Section 5 considers the optimal replacement problem for items with the described types of repair. Finally, brief conclusions are given in Section 6.

2. Preliminaries

This supplementary section provides general concepts and main definitions for description of univariate and multivariate processes via the stochastic intensity. There can be other ways of characterization; however, for our study, this is the most appropriate one. The discussion in this section basically follows that of Cha [Reference Cha9] and Cha and Giorgio [Reference Cha and Giorgio12] and contains descriptions that are necessary for the presentation of further results.

Description of a univariate counting process

Denote by $\{N(t),~t\geq0\}$ an orderly point process, and let ${\mathcal{H}}_{t-} \equiv \{N(u),~0\leq u \lt t\}$ be its history in $[0,t)$, that is, the set of all previous point events in $[0,t)$. Observe that ${\mathcal{H}}_{t-}$ can equivalently be defined in terms of $N(t-)$ and the sequential arrival points of the events $0\leq T_1\leq T_2 \leq \cdots \leq T_{N(t-)} \lt t$ in $[0,t)$, where Ti is the time from 0 until the arrival of the ith event in $[0,t)$. At many instances and especially in reliability studies, it is useful to define point processes using the concept of the stochastic intensity λt, $t\geq 0$ (the intensity process) (Aven and Jensen [Reference Aven and Jensen1, Reference Aven and Jensen2]). As discussed in Cha and Finkelstein [Reference Cha and Finkelstein10], the stochastic intensity λt of an orderly point process $\{N(t),~t\geq0\}$ is defined as the following limit:

(3)\begin{eqnarray} \lambda_{t} &\equiv& \lim_{\Delta t \rightarrow 0} \frac{P\left(N(t,t+\Delta t)=1|{\mathcal{H}}_{t-}\right)}{\Delta t} \cr &=& \lim_{\Delta t \rightarrow 0} \frac{E\left[N(t, t+\Delta t)|{\mathcal{H}}_{t-}\right]}{\Delta t}, \end{eqnarray}

where $N(t_1,t_2)$, $t_1 \lt t_2$, is the number of events in $[t_1 , t_2)$. It has the following infinitesimal interpretation (heuristic)

(4)\begin{eqnarray} \lambda_{t}\,{\rm d}t = E\left[{\rm d}N(t)|{\mathcal{H}}_{t-}\right], \end{eqnarray}

which is similar to the ordinary failure (hazard) rate of a random variable (Aven and Jensen [Reference Aven and Jensen1]).

It is well known that the intensity function (rate) of a point process $\{N(t),~t\geq0\}$, that distinct from the stochastic intensity does not fully characterize it, is defined as

\begin{eqnarray*} \phi(t)\equiv \frac{{\rm d} E[N(t)]} {{\rm d}t}=\lim_{\Delta t \rightarrow 0} \frac{E[N(t+\Delta t)]-E[N(t)]} {\Delta t}=\lim_{\Delta t \rightarrow 0} \frac{E[N(t,t+\Delta t)]} {\Delta t}. \end{eqnarray*}

For orderly processes,

\begin{eqnarray*} \phi(t)=\lim_{\Delta t \rightarrow 0} \frac{P(N(t,t+\Delta t)=1)} {\Delta t}. \end{eqnarray*}

Therefore, the intensity function $\phi(t)$ can be considered as an unconditional version of the stochastic intensity λt.

Using the concept of stochastic intensity, the GPP can be defined as follows.

Definition 2.1. (Generalized Polya process)

A counting process $\{N(t),~t\geq0\}$ is called the GPP with the set of parameters $(\lambda(t),\alpha,\beta)$, $\alpha \geq 0$, β > 0, if

  1. (i) $N(0)=0$;

  2. (ii) $\lambda_t=(\alpha N(t-)+\beta)\lambda(t)$.

It can be easily seen that the GPP with $(\lambda(t),\alpha=0,\beta=1)$ reduces to the NHPP with the rate function $\lambda(t)$.

Let now $\{N(t),~ t \geq 0 \}$ be interpreted as the failure/instantaneous repair process for a repairable item with a lifetime characterized by the failure rate $\lambda(t)$, where N(t) is the total number of failures/repairs in $(0, t]$.

Definition 2.2. (GPP repair)

The failure/repair process for an item with the failure rate $\lambda(t)$ is called the “GPP repair” with parameter α if $\{N(t), t \geq 0 \}$ is the GPP with the parameter set $(\lambda(t),\alpha,1)$.

Description of a bivariate counting process

We will use the bivariate counting process for description of the new process that will be defined in the next section. Let $\{{\mathbf{N}}(t),t\geq0\}$, where ${\mathbf{N}}(t)=(N_1(t),N_2(t))$, be a bivariate process. The corresponding “pooled” point process $\{M(t),~t\geq0\}$ is defined as the sum $M(t)=N_1(t)+N_2(t)$, whereas the marginal point processes $\{N_i(t),~t\geq0\}$, for convenience, will be called type i point process, $i=1,2$, respectively. Furthermore, the events from type i point process $\{N_i(t),~t\geq0\}$ will also be called type i events. There are two types of regularity that occur in multivariate point processes: (i)marginal regularity and (ii)regularity (see Cha and Giorgio [Reference Cha and Giorgio12] for corresponding definitions). In this paper, we will consider regular (also known as orderly) multivariate point processes.

Let ${\mathcal{H}}_{Pt-} \equiv \{M(u),~0\leq u \lt t\}$ be the history (internal filtration) of the pooled process in $[0,t)$, that is, the set of all point events in $[0,t)$. Observe that ${\mathcal{H}}_{Pt-}$ can equivalently be defined in terms of $M(t-)$ and the sequential arrival points of the events $0\leq T_1\leq T_2 \leq \cdots \leq T_{M(t-)} \lt t$ in $[0,t)$, where $M(t-)$ is the total number of events in $[0,t)$ and Ti is the time from 0 until the arrival of the ith event in $[0,t)$ of the pooled process $\{M(t),t\geq0\}$. Similarly, define the marginal histories of the marginal processes ${\mathcal{H}}_{it-} \equiv \{N_i(u),0\leq u \lt t\}$, $i=1,2$. Then, ${\mathcal{H}}_{it-} \equiv \{N_i(u),0\leq u \lt t\}$ can also be completely defined in terms of $N_i(t-)$ and the sequential arrival points of the events $0\leq T_{i1}\leq T_{i2} \leq \cdots \leq T_{iN_i(t-)} \lt t$ in $[0,t)$, $i=1,2$, where $N_i(t-)$ is the total number of events of type i point process in $[0,t)$, $i=1,2$.

Although multivariate point processes can be defined in different ways, the most convenient general characterization (especially for applications) can also be done through the stochastic intensity approach. A “marginally regular bivariate process” can be specified by

(5)\begin{eqnarray} &&\lambda_{1t} \equiv \lim_{\Delta t \rightarrow 0} \frac{P\left(N_1(t,t+\Delta t)\geq 1|{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)}{\Delta t}=\lim_{\Delta t \rightarrow 0} \frac{P\left(N_1(t,t+\Delta t)=1|{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)}{\Delta t}, \cr && \lambda_{2t} \equiv \lim_{\Delta t \rightarrow 0} \frac{P\left(N_2(t,t+\Delta t)\geq 1|{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)}{\Delta t}=\lim_{\Delta t \rightarrow 0} \frac{P\left(N_2(t,t+\Delta t)=1|{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)}{\Delta t}, \cr && \lambda_{12t} \equiv \lim_{\Delta t \rightarrow 0} \frac{P\left(N_1(t,t+\Delta t)N_2(t,t+\Delta t)\geq 1|{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)}{\Delta t}, \end{eqnarray}

where $N_i(t_1,t_2)$, $t_1 \lt t_2$, represent the number of events in $[t_1 , t_2)$, $i=1,2$, respectively (see Cox and Lewis [Reference Cox and Lewis13]). The functions in Eq. (5) are called the complete intensity functions. For a regular bivariate process, $\lambda_{12t}=0$, and it is sufficient to specify just $\lambda_{1t}$ and $\lambda_{2t}$ in Eq. (5).

3. Characterization of a new bivariate counting process

Let $\{M(t),~t\geq0\}$ be an orderly univariate counting process with sequential arrival points of the events $0\leq T_1\leq T_2 \leq \cdots$. Consider a sequence of random variables $\{I_1,I_2,\ldots\}$ with $I_j=1$ with probability $p(t_j)$ and $I_j=0$ with probability $1-p(t_j)$, $j=1,2,\ldots$, where tj is the realization of Tj. We assume that, given $\{T_1,T_2,\ldots,T_n\}$, $\{I_1,I_2,\ldots, I_n\}$ are independent, $n=1,2,\ldots$. Furthermore, given $T_{M(t-)+1}$, the random variable $I_{M(t-)+1}$ does not depend on $\{T_1,T_2,\ldots,T_{M(t-)},M(t-); I_1,I_2,\ldots,I_{M(t-)}\}$, t > 0. We assume that the conditional stochastic intensity of $\{M(t), t\geq0\}$ with additionally given $\{I_1,I_2,\cdots\}$ is specified by

(6)\begin{eqnarray} \lambda_{t|I_{t-}} &\equiv& \lim_{\Delta t \rightarrow 0} \frac{P\left(M(t,t+\Delta t)=1|T_1,T_2,\ldots,T_{M(t-)},M(t-); I_1,I_2,\ldots,I_{M(t-)}\right)}{\Delta t} \cr &=& \left(\alpha \sum_{j=1}^{M(t-)}I_j +1\right)\lambda(t). \end{eqnarray}

The interpretation of the conditional stochastic intensity in Eq. (6) is as follows. A counting process starts at time 0 with baseline intensity $\lambda(t)$. On each event occurrence, with probability p(t), the stochastic intensity increases according to the GPP pattern (GPP repair, type 1 event) and, with probability $1-p(t)$, the stochastic intensity is the same as that just before the occurrence of the event (minimal repair, type 2 event), where t is the occurrence time of the event. Clearly, when $p(t)=1$ for all t > 0, $I_j=1$, $j=1,2,\ldots$ (thus the conditional part $\{I_1,I_2,\ldots,I_{M(t-)}\}$ is not necessary anymore), the conditional stochastic intensity (6) reduces to the usual stochastic intensity in Definition 2.1 and the counting process model becomes the GPP. On the other hand, when $p(t)=0$ for all t > 0, $I_j=0$, $j=1,2,\cdots$, and the counting process model becomes the NHPP with rate $\lambda(t)$. Thus, the counting process model in Eq. (6) can be used as the model for a generalized minimal and GPP repairs.

From the counting process model in Eq. (6), it can be seen that, on each event, the type of event can be classified into two types: type 1 and type 2. Thus, we can now define a bivariate counting process $\{(N_1(t),N_2(t)), t\geq0\}$. For convenience, we use the notations defined in the previous section to describe this bivariate process and the pooled process. To formally characterize the bivariate process $\{(N_1(t),N_2(t)), t\geq0\}$ generated from the pooled process $\{M(t), t\geq0\}$, as mentioned in the previous section, we need to specify the stochastic intensities $\lambda_{1t}$ and $\lambda_{2t}$.

Proposition 3.1. The stochastic intensity $\lambda_{1t}$ and $\lambda_{2t}$ for $\{(N_1(t),N_2(t)), t\geq0\}$ are given by

\begin{eqnarray*} \lambda_{1t}=(\alpha {N_1(t-)} +1)p(t)\lambda(t); \end{eqnarray*}
\begin{eqnarray*} \lambda_{2t}=(\alpha {N_1(t-)} +1)(1-p(t))\lambda(t). \end{eqnarray*}

Proof. Note that each event in $\{M(t), t\geq0\}$ is classified into two types of events independently of everything else. Note also that the joint history $\{{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\}$ can be equivalently defined by $\{T_1,T_2,\ldots,T_{M(t-)},M(t-); I_1,I_2,\ldots,I_{M(t-)}\}$. Thus,

\begin{eqnarray*} \lambda_{1t} &=&\lim_{\Delta t \rightarrow 0} \frac{P\left(N_1(t,t+\Delta t)=1|{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)}{\Delta t} \cr&=&\lim_{\Delta t \rightarrow 0} \frac{P\left(\{M(t,t+\Delta t)=1\} \cap \{\text{The event is type 1}\}|{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)}{\Delta t} \cr&=&\lim_{\Delta t \rightarrow 0} {P\left(\text{The event is type 1}|M(t,t+\Delta t)=1;{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)} \cr&& \times \frac{P\left(M(t,t+\Delta t)=1|{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)}{\Delta t} \cr&=&p(t)\lim_{\Delta t \rightarrow 0} \frac{P\left(M(t,t+\Delta t)=1|{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)}{\Delta t} \cr&=&p(t)\cdot \lim_{\Delta t \rightarrow 0} \frac{P\left(M(t,t+\Delta t)=1|T_1,T_2,\ldots,T_{M(t-)},M(t-); I_1,I_2,\ldots,I_{M(t-)}\right)}{\Delta t} \cr &=& \left(\alpha \sum_{j=1}^{M(t-)}I_j +1\right)p(t)\lambda(t)=(\alpha N_1(t-) +1)p(t)\lambda(t). \end{eqnarray*}

By similar arguments, we have $\lambda_{2t}=(\alpha {N_1(t-)} +1)(1-p(t))\lambda(t)$.

The following proposition further characterizes the pooled process $\{M(t), t\geq0\}$ and the marginal processes $\{N_i(t), t\geq0\}$, $i=1,2$. Denote by λMt, $\lambda_{N_it}$, $i=1,2$, the stochastic intensities of the pooled process $\{M(t),~t\geq0\}$ and the marginal processes $\{N_i(t),~t\geq0\}$, $i=1,2$, respectively.

Proposition 3.2. For the pooled process $\{M(t), t\geq0\}$ and the marginal processes $\{N_i(t), t\geq0\}$, $i=1,2$, the following properties hold.

  1. (i) The stochastic intensity λMt of the pooled process $\{M(t),~t\geq0\}$ is given by

    \begin{eqnarray*} \lambda_{Mt}= \lambda(t),\quad\text{if}\ M(t-)=0; \end{eqnarray*}
    otherwise,
    \begin{eqnarray*} \lambda_{Mt}&=& \sum_{i_1=0,1}\sum_{i_2=0,1}\cdots \sum_{i_{M(t-)}=0,1}\left(\alpha \sum_{j=1}^{M(t-)}i_j +1\right)\lambda(t) \cr&& \times \frac{g(i_1,i_2,\ldots,i_{M(t-)},T_1,T_2,\ldots, T_{M(t-)},M(t-))}{\sum_{i_1=0,1}\sum_{i_2=0,1}\cdots \sum_{i_{M(t-)}=0,1}g(i_1,i_2,\ldots,i_{M(t-)},T_1,T_2,\ldots, T_{M(t-)},M(t-))}, \end{eqnarray*}
    where
    \begin{align*} g(i_1,i_2,\ldots,i_m,t_1,t_2,\ldots, t_m,m)&\equiv \left\{\prod_{j=1}^{m} p(t_j)^{i_j}(1-p(t_j))^{1-i_j} \right\}\\ & \times \left\{\prod_{k=1}^{m} \exp\left\{-\int_{t_{k-1}}^{t_k} \left(\alpha \sum_{l=1}^{k-1}i_l +1\right)\lambda(u)\,{\rm d}u\right\} \left(\alpha \sum_{l=1}^{k-1}i_l +1\right)\lambda(t_k) \right\}\\ & \times \exp\left\{-\int_{t_{t_m}}^{t} \left(\alpha \sum_{l=1}^{m}i_l +1\right)\lambda(u)\,{\rm d}u\right\}, \end{align*}
    with $t_0=0$.
  2. (ii) The stochastic intensity $\lambda_{N_1t}$ of the marginal processes $\{N_1(t), t\geq0\}$ is given by

    \begin{eqnarray*} \lambda_{N_1t}=(\alpha {N_1(t-)} +1)p(t)\lambda(t). \end{eqnarray*}

    Thus, the marginal process $\{N_1(t), t\geq0\}$ is the GPP with the set of parameters $(p(t)\lambda(t), \alpha, 1)$.

  3. (iii) Given the history of type 1 process, type 2 process is conditionally NHPP with the rate function

    (7)\begin{eqnarray} \lambda(t|{\mathcal{H}}_{1t-})=(\alpha N_1(t-) +1)\lambda(t),\quad t \gt 0. \end{eqnarray}

    Thus, type 2 process is mixing of the NHPP with respect to the mixing rate function in Eq. (7).

Proof. It is clear that $\lambda_{Mt}= \lambda(t)$ if $M(t-)=0$. Now suppose that $M(t-)\geq 1$. The pooled process $\{M(t), t\geq0\}$ can be characterized by its stochastic intensity

\begin{eqnarray*} \lambda_{Mt}= \lim_{\Delta t \rightarrow 0} \frac{P\left(M(t,t+\Delta t)=1|T_1,T_2,\ldots,T_{M(t-)},M(t-)\right)}{\Delta t}. \end{eqnarray*}

From the conditional stochastic intensity in Eq. (6), λMt can be obtained by

\begin{eqnarray*} \lambda_{Mt}=E[\lambda_{t|I_{t-}}|T_1,T_2,\ldots,T_{M(t-)},M(t-)]. \end{eqnarray*}

Thus, we need the conditional joint distribution of $(I_1,I_2,\ldots,I_{M(t-)}|T_1,T_2,\ldots,T_{M(t-)},M(t-))$. The joint distribution of $(I_1,I_2,\ldots,I_{M(t-)};T_1,T_2,\ldots,T_{M(t-)},M(t-))$ is given by

\begin{align*} g(i_1,i_2,\ldots,i_m,t_1,t_2,\ldots, t_m,m)&\equiv \left\{\prod_{j=1}^{m} p(t_j)^{i_j}(1-p(t_j))^{1-i_j} \right\}\\ & \times \left\{\prod_{k=1}^{m} \exp\left\{-\int_{t_{k-1}}^{t_k} \left(\alpha \sum_{l=1}^{k-1}i_l +1\right)\lambda(u)\,{\rm d}u\right\} \left(\alpha \sum_{l=1}^{k-1}i_l +1\right)\lambda(t_k) \right\}\\ & \times \exp\left\{-\int_{t_{t_m}}^{t} \left(\alpha \sum_{l=1}^{m}i_l +1\right)\lambda(u)\,{\rm d}u\right\}, \end{align*}

where $t_0=0$. Then, the joint distribution of $(T_1,T_2,\ldots,T_{M(t-)},M(t-))$ is given by

\begin{eqnarray*} \sum_{i_1=0,1}\sum_{i_2=0,1}\cdots \sum_{i_m=0,1}g(i_1,i_2,\ldots,i_m,t_1,t_2,\ldots, t_m,m). \end{eqnarray*}

Thus, the conditional joint distribution of $(I_1,I_2,\ldots,I_{M(t-)}|T_1,T_2,\ldots,T_{M(t-)},M(t-))$ is given by

\begin{eqnarray*} \frac{g(i_1,i_2,\ldots,i_m,t_1,t_2,\ldots, t_m,m)}{\sum_{i_1=0,1}\sum_{i_2=0,1}\cdots \sum_{i_m=0,1}g(i_1,i_2,\ldots,i_m,t_1,t_2,\ldots, t_m,m)}. \end{eqnarray*}

Then, λMt can be obtained by

\begin{eqnarray*} \lambda_{Mt}&=& \sum_{i_1=0,1}\sum_{i_2=0,1}\cdots \sum_{i_m=0,1}\left(\alpha \sum_{j=1}^{M(t-)}i_j +1\right)\lambda(t) \cr&&\times \frac{g(i_1,i_2,\ldots,i_{M(t-)},T_1,T_2,\ldots, T_{M(t-)},M(t-))}{\sum_{i_1=0,1}\sum_{i_2=0,1}\cdots \sum_{i_m=0,1}g(i_1,i_2,\ldots,i_{M(t-)},T_1,T_2,\ldots, T_{M(t-)},M(t-))}. \end{eqnarray*}

From Proposition 3.1,

\begin{eqnarray*} \lambda_{1t}&=&\lim_{\Delta t \rightarrow 0} \frac{P\left(N_1(t,t+\Delta t)=1|{\mathcal{H}}_{1t-};{\mathcal{H}}_{2t-}\right)}{\Delta t}=(\alpha {N_1(t-)} +1)p(t)\lambda(t), \end{eqnarray*}

which does not depend on ${\mathcal{H}}_{2t-}$. Thus,

\begin{eqnarray*} \lambda_{1t}=\lim_{\Delta t \rightarrow 0} \frac{P\left(N_1(t,t+\Delta t)=1|{\mathcal{H}}_{1t-}\right)}{\Delta t}= \lambda_{N_1t} \end{eqnarray*}

From Proposition 3.1, given a fixed history ${\mathcal{H}}_{1t-}$, the stochastic intensity $\lambda_{2t}$ is given by a deterministic function with respect to the history ${\mathcal{H}}_{2t-}$

\begin{eqnarray*} (\alpha {N_1(t-)} +1)(1-p(t))\lambda(t). \end{eqnarray*}

This implies that type 2 process is defined via mixing of the NHPP with respect to the mixing rate function (7). In other words, given the history of type 1 process, type 2 process is conditionally NHPP with the rate function in Eq. (7).

Remark 3.3.

  1. (i) Although the stochastic intensity of the pooled process $\{M(t), t\geq0\}$ can be expressed in explicit form, the pooled process $\{M(t), t\geq0\}$ does not belong to a known class of processes.

  2. (ii) The marginal process $\{N_2(t), t\geq0\}$ belongs to a class of mixed NHPP, but its stochastic intensity cannot be expressed in a closed form.

In Propositions 3.1 and 3.2, the stochastic intensity functions for the bivariate counting process $\{(N_1(t),N_2(t)), t\geq0\}$ and the corresponding marginal processes have been derived. In the following result, we derive the expressions for the joint distribution for $(N_1(t),N_2(t))$ and the corresponding marginal distributions. For the description of the following proposition, we define $\Lambda(t)\equiv\int_{0}^{t}\lambda(x)\,{\rm d}x$, $\Lambda_p(t)\equiv\int_{0}^{t}p(x)\lambda(x)\,{\rm d}x$, $t_{10}\equiv0$, $t_{1,n_1+1}\equiv t$,

\begin{eqnarray*} \text{Poi}(n; \phi)\equiv\frac{\phi^n}{n!}\exp\{-\phi\}, \end{eqnarray*}
\begin{eqnarray*} &&g(t_{11}, t_{12}, \ldots, t_{1n_1}, n_1)\cr&& \equiv n_1!\prod_{i=1}^{n_1}\frac{\alpha p(t_{1i})\lambda(t_{1i})\,\exp\{\alpha \Lambda_p(t_{1i})\}} {\exp\{\alpha \Lambda_p(t_{1i})\}-1}, n_1 \geq 1, 0 \lt t_{11} \lt t_{12} \lt \cdots \lt t_{1n_1} \lt t. \end{eqnarray*}

Proposition 3.4. The joint distribution for $(N_1(t),N_2(t))$ and the corresponding marginal distributions are given as follows.

\begin{align*} (i)\, P(N_1(t)=n_1,N_2(t)& =n_2)=\int_{0}^{t} \int_{0}^{t_{1n_1}}\cdots \int_{0}^{t_{12}} \text{Poi}\left(n_2;\sum_{i=0}^{n_1} (i\alpha +1)[\Lambda(t_{1, i+1})- \Lambda(t_{1i})]\right)\\ & \qquad\qquad \times g(t_{11}, t_{12}, \ldots, t_{1n_1}, n_1){\rm d}t_{11}\cdots {\rm d}t_{1n_1}\\ & \qquad\qquad \times \frac{\Gamma(1/\alpha+n_1)}{\Gamma(1/\alpha)n_1!}(1-\exp\{-\alpha \Lambda_p(t)\})^{n_1}(\exp\{-\alpha \Lambda_p(t)\})^{1/\alpha},\\ & \qquad\qquad\quad ~n_1=1,2,\ldots, \end{align*}

and

\begin{eqnarray*} P(N_1(t)=0,N_2(t)=n_2)=\text{Poi}(n_2;\Lambda(t)) \cdot \exp\{- \Lambda_p(t)\}. \end{eqnarray*}
\begin{eqnarray*} (ii)\, P(N_1(t)=n_1)=\frac{\Gamma(1/\alpha+n_1)}{\Gamma(1/\alpha)n_1!}(1-\exp\{-\alpha \Lambda_p(t)\})^{n_1}(\exp\{-\alpha \Lambda_p(t)\})^{1/\alpha}. \end{eqnarray*}
\begin{align*} (iii)\, P(N_2(t)=n_2)& =\text{Poi}(n_2;\Lambda(t)) \cdot \exp\{- \Lambda_p(t)\}\\ & \quad +\sum_{n_1=1}^{\infty} \left(\int_{0}^{t} \int_{0}^{t_{1n_1}}\cdots \int_{0}^{t_{12}} \text{Poi}\left(n_2;\sum_{i=0}^{n_1} (i\alpha +1)[\Lambda(t_{1, i+1})- \Lambda(t_{1i})]\right)\right.\\ & \quad \times g(t_{11}, t_{12}, \ldots, t_{1n_1}, n_1) {\rm d}t_{11}\cdots {\rm d}t_{1n_1} \\ & \quad \left.\times \frac{\Gamma(1/\alpha+n_1)}{\Gamma(1/\alpha)n_1!}(1-\exp\{-\alpha \Lambda_p(t)\})^{n_1}(\exp\{-\alpha \Lambda_p(t)\})^{1/\alpha}\right). \end{align*}

Proof. Denote by $0 \lt T_{11} \lt T_{12} \lt \cdots$ the sequential arrival times of the marginal process $\{N_1(t),~t\geq0\}$. Clearly, if $n_1=0$, $P(N_2(t)=n_2|N_1(t-)=n_1)=\text{Poi}(n_2;\Lambda(t))$. If $n_1\geq 1$, from Proposition 3.2 (iii), given $(T_{11}=t_{11},T_{12}=t_{12},\ldots, T_{1N_1(t-)}=t_{1n_1},N_1(t-)=n_1)$,

\begin{eqnarray*} &&\int_{0}^{t}(\alpha N_1(x-) +1)\lambda(x){\rm d}t \cr&&=\int_{0}^{t_{11}}\lambda(x)\,{\rm d}x+\int_{t_{11}}^{t_{12}}(\alpha+1)\lambda(x)\,{\rm d}x+\cdots+\int_{t_{1n_1}}^{t}(n_1\alpha+1)\lambda(x)\,{\rm d}x \cr&&=\sum_{i=0}^{n_1}(i\alpha+1)[\Lambda(t_{1,i+1})-\Lambda(t_i)], \end{eqnarray*}

and thus the conditional distribution of $N_2(t)$ is given by

\begin{eqnarray*} &&P(N_2(t)=n_2|T_{11}=t_{11},T_{12}=t_{12},\ldots, T_{1N_1(t-)}=t_{1n_1},N_1(t-)=n_1)\cr &=&\frac{\left(\sum_{i=0}^{n_1} (i\alpha +1)[\Lambda(t_{1, i+1})- \Lambda(t_{1i})] \right)^{n_2}}{n_2!} \exp\left\{-\sum_{i=0}^{n_1} (i\alpha +1)[\Lambda(t_{1,i+1})- \Lambda(t_{1i})]\right\}. \end{eqnarray*}

As the marginal process $\{N_1(t), t\geq0\}$ is the GPP with the set of parameters $(p(t)\lambda(t), \alpha, 1)$, from Cha [Reference Cha9], the joint conditional arrival time distribution of $(T_{11},T_{12},\ldots, T_{1N_1(t-)}|N_1(t-))$ is given by

\begin{eqnarray*} n_1!\prod_{i=1}^{n_1}\frac{\alpha p(t_{1i})\lambda(t_{1i})\exp\{\alpha \Lambda_p(t_{1i})\}} {\exp\{\alpha \Lambda_p(t_{1i})\}-1}. \end{eqnarray*}

Thus, for $n_1\geq 1$, the conditional distribution of $(N_2(t)|N_1(t))$ is given by

(8)\begin{align} P(N_2(t)& =n_2|N_1(t)=n_1)=\int_{0}^{t} \int_{0}^{t_{1n_1}}\cdots \int_{0}^{t_{12}} \frac{\left(\sum_{i=0}^{n_1} (i\alpha +1)[\Lambda(t_{1, i+1})- \Lambda(t_{1i})] \right)^{n_2}}{n_2!}\nonumber \\ & \qquad \times\exp\left\{-\sum_{i=0}^{n_1} (i\alpha +1)[\Lambda(t_{1,i+1})- \Lambda(t_{1i})]\right\}\nonumber \\ & \qquad \times n_1!\prod_{i=1}^{n_1}\frac{\alpha p(t_{1i})\lambda(t_{1i})\exp\{\alpha \Lambda_p(t_{1i})\}} {\exp\{\alpha \Lambda_p(t_{1i})\}-1}{\rm d}t_{11}\cdots {\rm d}t_{1n_1}. \end{align}

On the other hand, from Cha [Reference Cha9], the marginal distribution of $N_1(t)$ is given by

(9)\begin{eqnarray} P(N_1(t)=n_1)=\frac{\Gamma(1/\alpha+n_1)}{\Gamma(1/\alpha)n_1!}(1-\exp\{-\alpha \Lambda_p(t)\})^{n_1}(\exp\{-\alpha \Lambda_p(t)\})^{1/\alpha}. \end{eqnarray}

Combining Eqs. (8) and (9), we can obtain the desired results.

4. Intensity function approach

In the previous section, the bivariate process $\{(N_1(t),N_2(t)), t\geq0\}$, the pooled process $\{M(t), t\geq0\}$ and the marginal processes $\{N_i(t), t\geq0\}$, $i=1,2$, have been characterized. As mentioned before, $\{M(t), t\geq0\}$ does not belong to a known class of processes and it is difficult to obtain further properties of $\{N_2(t), t\geq0\}$ in explicit forms. On the other hand, in various applications (e.g., as in the optimal replacement problem considered as a reliability application in the next section), we need only the expected values of $N_i(t)$, $i=1,2$. Thus, in this section, we derive $E[M(t)]$, $E[N_i(t)]$, $i=1,2$, relying on the intensity function approach.

Recall that the intensity function (rate) of an orderly counting process $\{N(t),~t\geq0\}$ is defined by

\begin{eqnarray*} \phi(t)\equiv \frac{{\rm d} E[N(t)]} {{\rm d}t}=\lim_{\Delta t \rightarrow 0} \frac{E[N(t,t+\Delta t)]} {\Delta t}=\lim_{\Delta t \rightarrow 0} \frac{P(N(t,t+\Delta t)=1)} {\Delta t}. \end{eqnarray*}

Thus, if $\phi(t)$ is given, $E[N(t)]$ can be obtained as

\begin{eqnarray*} E[N(t)]=\int_{0}^{t}\phi(u)\,{\rm d}u. \end{eqnarray*}

In the following, we denote by $\phi_M(t)$, $\phi_{N_1}(t)$ and $\phi_{N_2}(t)$ the intensity functions of $\{M(t), t\geq0\}$ and $\{N_i(t), t\geq0\}$, $i=1,2$, respectively.

Proposition 4.1. The intensity functions $\phi_M(t)$, $\phi_{N_1}(t)$ and $\phi_{N_2}(t)$ are given by

\begin{eqnarray*} \phi_M(t)=\lambda(t)\,\exp\{\alpha \Lambda_p(t)\}, \end{eqnarray*}
\begin{eqnarray*} \phi_{N_1}(t)=p(t)\lambda(t)\,\exp\{\alpha \Lambda_p(t)\}, \end{eqnarray*}
\begin{eqnarray*} \phi_{N_2}(t)=(1-p(t))\lambda(t)\,\exp\{\alpha \Lambda_p(t)\}, \end{eqnarray*}

and the expectations are given by

\begin{eqnarray*} E[M(t)]=\int_{0}^{t}\lambda(u)\,\exp\{\alpha \Lambda_p(u)\}\,{\rm d}u, \end{eqnarray*}
\begin{eqnarray*} E[N_1(t)]=\frac{1}{\alpha}\left(\exp\{\alpha \Lambda_p(t)\}-1\right), \end{eqnarray*}
\begin{eqnarray*} E[N_2(t)]=\int_{0}^{t}(1-p(u))\lambda(u)\,\exp\{\alpha \Lambda_p(u)\}{\rm d}u. \end{eqnarray*}

Proof. As $\{N_1(t), t\geq0\}$ is the GPP with the set of parameters $(p(t)\lambda(t), \alpha, 1)$,

\begin{eqnarray*} P(N_1(t)=n)=\frac{\Gamma(1/\alpha+n)}{\Gamma(1/\alpha)n!} \left( 1-\exp\{-\alpha\Lambda_p(t)\}\right)^{n}\left( \exp\{-\alpha\Lambda_p(t)\} \right)^{\frac{1}{\alpha}}, \end{eqnarray*}

where $\Lambda_p(t)=\int_{0}^{t} p(u)\lambda(u)\,{\rm d}u$ (see Cha [Reference Cha9]). Thus,

\begin{eqnarray*} E[N_1(t)]=\frac{1}{\alpha}\left(\exp\{\alpha \Lambda_p(t)\}-1\right) \end{eqnarray*}

and

\begin{eqnarray*} \phi_{N_1}(t)=p(t)\lambda(t)\,\exp\{\alpha \Lambda_p(t)\}. \end{eqnarray*}

For the pooled process $\{M(t), t\geq0\}$,

\begin{eqnarray*} \lim_{\Delta t \rightarrow 0} \frac{P(M(t+\Delta t,t)=1|N_1(t)=n)} {\Delta t}=(\alpha n +1)\lambda(t). \end{eqnarray*}

Thus,

\begin{eqnarray*} \phi_M(t)&=& \lim_{\Delta t \rightarrow 0} \frac{P(M(t+\Delta t,t)=1)} {\Delta t} \cr&=&\lim_{\Delta t \rightarrow 0} \frac{E[P(M(t+\Delta t,t)=1|N_1(t))]} {\Delta t}\cr &=&E\left[ \lim_{\Delta t \rightarrow 0} \frac{P(M(t+\Delta t,t)=1|N_1(t))} {\Delta t} \right]\cr &=&E\left[ (\alpha N_1(t)+1)\lambda(t)\right]\cr &=&\lambda(t)\exp\{\alpha \Lambda_p(t)\}. \end{eqnarray*}

The expectation of M(t) then can be obtained by

\begin{eqnarray*} E[M(t)]=\int_{0}^{t}\lambda(u)\,\exp\{\alpha \Lambda_p(u)\}{\rm d}u. \end{eqnarray*}

As the involved processes are all orderly processes and $M(t)=N_1(t)+N_2(t)$,

\begin{eqnarray*} \phi_M(t)&=& \lim_{\Delta t \rightarrow 0} \frac{P(M(t+\Delta t,t)=1)} {\Delta t} \cr&=& \lim_{\Delta t \rightarrow 0} \frac{P(N_1(t+\Delta t,t)+N_2(t+\Delta t,t)=1)} {\Delta t} \cr&=& \lim_{\Delta t \rightarrow 0} \frac{P(N_1(t+\Delta t,t)=1 \ \text{or}\ N_2(t+\Delta t,t)=1)} {\Delta t} \cr&=& \lim_{\Delta t \rightarrow 0} \frac{P(N_1(t+\Delta t,t)=1)+P(N_2(t+\Delta t,t)=1)} {\Delta t} \cr &=&\phi_{N_1}(t)+\phi_{N_2}(t). \end{eqnarray*}

Thus,

\begin{eqnarray*} \phi_{N_2}(t)=\phi_M(t)-\phi_{N_1}(t)=(1-p(t))\lambda(t)\,\exp\{\alpha \Lambda_p(t)\}, \end{eqnarray*}

and

\begin{eqnarray*} E[N_2(t)]=\int_{0}^{t}(1-p(u))\lambda(u)\,\exp\{\alpha \Lambda_p(u)\}\,{\rm d}u. \end{eqnarray*}

It is interesting to compare $E[N_2(t)]$ with the expected number of events in the NHPP with the intensity function $\int_{0}^{t}(1-p(u))\lambda(u)\,{\rm d}u.$ Thus, we see the “influence” of the process $N_1(t)$ on this characteristic, which is increasing exponentially in the integrand.

In the next section, we will illustrate these results by considering the corresponding optimal replacement problem. Note that it is possible because we need only the expected values for the numbers of GPP and minimal repairs.

5. Optimal replacement problem

A system with the baseline failure rate $\lambda(t)$ starts operation at t = 0. On each failure, with probability p(t), the system is GPP-repaired and with probability $1-p(t)$, it is minimally repaired. The corresponding costs are c GPP and cm, with $c_{\rm GPP} \gt c_{m}$. The system is replaced by a new one at its age T. The cost for the replacement is $c_{\rm r} \gt c_{\rm GPP}$. The latter is a natural assumption in preventive maintenance. Otherwise, all GPP repairs should be replacements in a cost-wise approach. Then, in accordance with periodic (with period T) replacement policy (see, e.g., Nakagawa [Reference Nakagawa15]), the long-run expected cost rate, which is also a cost rate for the replacement cycle, is given by the following expression

\begin{eqnarray*} c(T)=\frac{\frac{1}{\alpha}\left(\exp\{\alpha \Lambda_p(T)\}-1\right) \cdot c_{\rm GPP}+\int_{0}^{T}(1-p(u))\lambda(u)\,\exp\{\alpha \Lambda_p(u)\}{\rm d}u \cdot c_m+ c_{\rm r}}{T}. \end{eqnarray*}

It is easy to see that $ \lim_{T\rightarrow 0}C\left(T\right) = \infty $. Assume also that $ \lim_{T\rightarrow \infty }C\left(T\right) = \infty$. This is absolutely nonrestrictive and even decreasing failure rates $ \lambda (t)$, which are usually not considered in the PM modeling, can comply with this condition. It means that the optimal problem

\begin{eqnarray*} C\left(T_{m}\right) = \min_{T\geq 0}C(T) \end{eqnarray*}

has a finite solution in $[0,\infty)$.

Let us rewrite the objective function in the original form when the first term in the numerator is not integrated. This will help us to see the needed pattern

\begin{eqnarray*} C\left(T\right) =\frac{\int_{0}^{T}p\left(u\right)\lambda\left(u\right)\exp\left\{\alpha \Lambda_{p}\left(u\right)\right\}\, {\rm d}u\cdot c_{\rm GPP}+\int_{0}^{T}(1-p\left(u\right))\lambda\left(u\right)\exp\left\{\alpha \Lambda_{p}\left(u\right)\right\}\, {\rm d}u\cdot c_{m}+c_{r}}{T} \end{eqnarray*}

Consider now two supplementary objective functions

(10)\begin{eqnarray} C^{\ast \ast }\left(T\right) =\frac{\int_{0}^{T}\lambda\left(u\right)\,\exp\left\{\alpha \Lambda_{p}\left(u\right)\right\}\, {\rm d}u\cdot c_{\rm GPP}+c_{r}}{T} \end{eqnarray}
(11)\begin{eqnarray} C^{\ast}\left(T\right) =\frac{\int_{0}^{T}\lambda\left(u\right)\,\exp\left\{\alpha \Lambda_{p}\left(u\right)\right\} {\rm d}u\cdot c_{m}+c_{\rm r}}{T} \end{eqnarray}

The first one is obtained from C(T) by setting $ c_{\rm GPP} = c_{m}$ in the second integral in the numerator, whereas the second one, in the first integral. Thus, in one case, all failures are GPP repaired, in the other-minimally repaired. Obviously, in accordance with our assumptions on the costs

(12)\begin{equation} C^{\ast \ast }\left(T\right) \gt C^{\ast }\left(T\right), T \gt 0. \end{equation}

As we are considering only analytical expressions for expected values for the numbers of events, it is not important from what real stochastic processes they have originated, what really matters is these expressions. Therefore, the integral in Eqs. (10) and (11) can be also considered as the expected value of the number of events in the process of minimal repairs (NHPP) with the intensity function $ \lambda\left(u\right)\exp\left\{\alpha \Lambda_{p}\left(u\right)\right\}$, where as previously, $ \Lambda_{p}(t) = \int_{0}^{t}p\left(u\right)\lambda\left(u\right)\,{\rm d}u$. However, this periodic optimal replacement problem for the process of minimal repairs and replacements at $ t = T,2T,3T\ldots$ is well known and has a finite, unique optimal solution under mild conditions, which in our case can be formulated for both cases as (Nakagawa [Reference Nakagawa15]):

\begin{eqnarray*} \int_{0}^{\infty }u\,{\rm d}( \lambda\left(u\right)\,\exp\left\{\alpha \Lambda_{p}\left(u\right)\right\}) \gt \frac{c_{\rm r}}{c_{\rm GPP}}, \end{eqnarray*}
\begin{eqnarray*} \int_{0}^{\infty }u\,{\rm d}( \lambda\left(u\right)\,\exp\left\{\alpha \Lambda_{p}\left(u\right)\right\}) \gt \frac{c_{\rm r}}{c_{m}}. \end{eqnarray*}

Those are also absolutely nonrestrictive assumptions (see also Remark 5.1). Therefore, denote by $ T^{\ast \ast }$ the optimal solution minimizing the objective function (10) and by $ T^{\ast }$ that for (11). Our case is intermediate between two boundary cases when all events are either minimally or GPP repaired. From this and general considerations (the smaller costs of repair always result in the larger replacement time) and also from the fact that under our assumptions, we already know that the optimal replacement time exists and finite, the following bounds can be obtained for Tm:

\begin{eqnarray*} T^{\ast \ast } \lt T_{m} \lt T^{\ast }. \end{eqnarray*}

These bounds can be very useful in practice especially when there is no sufficient information with respect to probability p(t).

Remark 5.1. Note that the additional assumption for the Brown–Proschan model discussed in the Introduction to hold was

\begin{eqnarray*} \lim_{t\rightarrow \infty }\int_{0}^{t}p\left(u\right)\lambda\left(u\right) \,{\rm d}u = \infty \end{eqnarray*}

that guarantees that the distribution described by the failure rate $p(t)\lambda(t)\,{\rm d}t$ is proper. This condition is also relevant for our assumption $ \lim_{T\rightarrow \infty }C\left(T\right) = \infty$.

To investigate the range between the lower and upper bounds $T^{**}$ and $T^*$ in the optimization problem, numerical analysis has been performed. The results are summarized in Table 1.

Table 1. The upper and lower bounds $T^*$ and $T^{**}$ when $c_m=1$, $c_r=10$, $p(t)=0.5$, $t\geq0$

As can be seen from Table 1, (i) as c GPP decreases; (ii) as α increases; and (iii) as $\lambda(t)$ increases for each t, the range between the upper and lower bounds $T^*$ and $T^{**}$ becomes smaller.

6. Concluding remarks

In this paper, we propose a new stochastic point process. It combines the NHPP with the GPP and models the process of failures and instantaneous repairs of a repairable item. Each failure from this process is minimally repaired with a given probability and GPP-repaired with the complementary probability.

Characterization of the new process via the corresponding bivariate point process is presented. The marginal and the pooled processes are defined and described. The latter is the sum of the marginal processes.

Although the stochastic intensity of the pooled process $\{M(t), t\geq0\}$ can be expressed in explicit form, the pooled process $\{M(t), t\geq0\}$ does not belong to a known class of processes. On the other hand, the marginal process $\{N_2(t), t\geq0\}$ belongs to a class of mixed NHPP, but its stochastic intensity cannot be expressed in a closed form.

It is also shown that expected numbers of failures/repairs for marginal processes (and, therefore, for the pooled one) can be obtained in a simpler way using only the rates of these processes. This enables to consider the minimization of the expected long-run cost rate for the corresponding optimal replacement problem. Simple, effective bounds for this characteristic are obtained.

A possible generalization of the developed approach could be in adding the renewal points to the process while defining the probabilities of each type of repair on each failure (i.e., minimal, GPP and perfect). However, mathematical feasibility of this setting is still not clear.

Acknowledgements

The authors thank the Associate Editor and the reviewer for helpful comments and advice. This work was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (grant number: 2019R1A6A1A11051177).

Competing interests

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

Aven, T. & Jensen, U. (1999). Stochastic Models in Reliability. New York: Springer.CrossRefGoogle Scholar
Aven, T. & Jensen, U. (2000). A general minimal repair model. Journal of Applied Probability 37(1): 187197.CrossRefGoogle Scholar
Badia, F.G. & Berrade, M.D. (2006). Optimum maintenance of a system under two types of failure. International Journal of Materials and Structural Reliab 4(1): 2737.Google Scholar
Badia, F.G. & Berrade, M.D. (2007). Minimal repair model for systems under both unrevealed minor failures and unrevealed catastrophic failures. International Mathematical Forum 2(17–20): 819834.CrossRefGoogle Scholar
Badia, F.G. & Berrade, M.D. (2009). Optimum maintenance policy of a periodically inspected system under imperfect repair. Advances in Operations Research 2009: .CrossRefGoogle Scholar
Barlow, R.E. & Hunter, L. (1960). Optimum preventive maintenance policies. Operations Research 8(1): 90100.CrossRefGoogle Scholar
Block, H.W., Borges, W.S. & Savits, T.H. (1985). Age-dependent minimal repair. Journal of Applied Probability 22(2): 370385.CrossRefGoogle Scholar
Brown, M. & Proschan, F. (1983). Imperfect repair. Journal of Applied Probability 20(4): 851862.CrossRefGoogle Scholar
Cha, J.H. (2014). Characterization of the generalized Polya process and its applications. Advances in Applied Probability 46(4): 11481171.CrossRefGoogle Scholar
Cha, J.H. & Finkelstein, M. (2011). Stochastic intensity for minimal repairs in heterogeneous populations. Journal of Applied Probability 48(3): 868876.CrossRefGoogle Scholar
Cha, J.H. & Finkelstein, M. (2018). Point Processes for Reliability analysis: Shocks and Repairable Systems. London: Springer.CrossRefGoogle Scholar
Cha, J.H. & Giorgio, M. (2016). On a class of multivariate counting processes. Advances in Applied Probability 48(2): 443462.CrossRefGoogle Scholar
Cox, D.R. & Lewis, P.A.W. (1972). Multivariate point processes. Proceedings of the Sixth Berkeley Symposium in Mathematical Statistics (LeCam, L. M. Ed.), University of California Press: Berkeley. .Google Scholar
Lee, H. & Cha, J.H. (2016). New stochastic models for preventive maintenance and maintenance optimization. European Journal of Operational Research 255(1): 8090.CrossRefGoogle Scholar
Nakagawa, T. (2005). Maintenance Theory of reliability. London: Springer.Google Scholar
Navarro, J., Arriaza, A. & Suárez-Llorens, A. (2019). Minimal repair of failed components in coherent systems. European Journal of Operational Research 279(3): 951964.CrossRefGoogle Scholar
Figure 0

Table 1. The upper and lower bounds $T^*$ and $T^{**}$ when $c_m=1$, $c_r=10$, $p(t)=0.5$, $t\geq0$