Next Article in Journal
Mathematical Modeling of Neurons and Brain Networks: Fundamental Principles and Special Applications
Next Article in Special Issue
Calculation of the System Unavailability Measures of Component Importance Using the D2T2 Methodology of Fault Tree Analysis
Previous Article in Journal
Analysis of Noise-Induced Transitions in a Thermo-Kinetic Model of the Autocatalytic Trigger
Previous Article in Special Issue
Review Models and Methods for Determining and Predicting the Reliability of Technical Systems and Transport
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stochastic Orderings of the Idle Time of Inactive Standby Systems

Department of Statistics and Operations Research, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(20), 4303; https://doi.org/10.3390/math11204303
Submission received: 29 August 2023 / Revised: 26 September 2023 / Accepted: 14 October 2023 / Published: 16 October 2023
(This article belongs to the Special Issue Reliability Analysis and Stochastic Models in Reliability Engineering)

Abstract

:
In this paper, we consider a failed cold standby system and obtain stochastic bounds on the idle time of such systems. We state and prove that if the last spare in the system is exponentially distributed and if the components have log-concave lifetime distributions, then the idle time of a failed cold standby system is smaller than the sum of the idle times of the components in the system according to the likelihood ratio order. In order to compare the idle time of two cold standby systems with different numbers of spares and different observation times of the failure in terms of the likelihood ratio order, an additional result is presented. Finally, we establish sufficient conditions for the usual stochastic ordering between the idle time of a cold standby system of size two and the sum of the idle times of the components in the system. We provide several examples to show that the results are achievable.

1. Introduction

Consider n components operating sequentially with random lifetimes X 1 , X 2 , , X n such that the first component starts operating at time τ = 0 and has random lifetime X 1 while the remaining ( n 1 ) components do not operate and remain in standby mode. At time τ = X 1 , when the first component fails, the second component immediately starts working and has a random lifetime X 2 ; at time τ = X 1 + X 2 , when the second component fails, the third component immediately starts working, etc., such that at time τ = X 1 + X 2 + + X n the system fails. This is called a cold standby system with n units, in which the components work one after another until then the last component fails. Suppose that at the time τ = t , when an operator has performed an inspection, it is determined that the cold standby system is inactive. The idle time of the cold standby system is a dynamic random variable of the system that depends on the time t at which the system was found to be inactive. Thus, it is assumed that an interval of time has elapsed since the system was found to be inactive, implying that the observation of the system’s failure was lagged. It is assumed that X 1 , X 2 , , X n are independent; however, in general, they may not be identically distributed, for instance, if different types of components are installed in the system.
Single- and dual-unit redundant systems have been the subject of extensive research in the reliability literature because of their widespread use in modern business and industrial systems. Parallel and standby redundancy are the two main forms. In a standby system, the redundant units are not included in the system from the beginning, and are only included when they are needed, whereas in a parallel system they are included from the beginning. There are three types of standby units: cold, warm, and hot. Cold standby sparing is a reliable way to ensure that a system can continue to function as intended even if some of its components fail. In this technique, redundant standby elements are kept in a powerless cold mode to conserve resources and protect them from workloads. If an online component fails, a cold standby component can be activated to take over. Because a cold standby unit is unplugged and completely inactive, it cannot fail until the primary unit is replaced. Because it is only partially energized, a warm standby unit has a lower load. Although redundant, a hot standby device is fully functional in the system. The lifespan of cold standby systems can be described as being longer than other types of backup systems because they are not actively operated and as such are subject to less wear and tear. This can result in cost savings for organizations, as they do not need to replace or upgrade the system as frequently. However, the life of the system can be affected by factors such as the quality of the hardware and software used, maintenance practices, and frequency of use. Cold standby systems are commonly used in reliability to support critical systems and processes. Example applications of cold standby systems in reliability include:
(1) Data backup and recovery: cold standby systems can be used to store backup data and ensure its availability in the event of a system failure or malfunction.
(2) Emergency power supply: cold standby systems can be used as a backup power supply in the event of a power failure or malfunction to ensure that critical systems remain operational.
(3) Network redundancy: cold standby systems can be used for network redundancy to ensure that critical network services remain available in the event of a network outage or failure.
(4) Server redundancy: cold standby systems can be used for server redundancy to ensure that critical applications and services remain available in the event of a server failure or defect.
(5) Disaster recovery: cold standby systems can be used as part of a disaster recovery plan to provide backup support for critical systems and processes in the event of a natural disaster or other catastrophic event.
Overall, cold standby systems are an important tool for ensuring the reliability and availability of critical systems and processes. They can help organizations to minimize downtime and maintain continuity in the face of unexpected events. For example, k-out-of-n systems are a type of reliability system in which a system is considered functional as long as k or more of n components are functioning properly; in other words, the system fails only when fewer than k components are functioning properly. This type of system is often used in engineering and manufacturing applications where redundancy is required to ensure the system’s continued functionality even if some of its components fail. The values of k and n can vary depending on the specific application and the level of reliability required. A situation in which such a standby system is used is that of k-out-of-n systems (see, e.g., Levitin et al. [1], Fernández [2], Barron and Yechiali [3], Barron [4], Levitin et al. [5], Bian et al. [6], and references therein). The method of cold standby has been widely utilized in crucial scenarios such as flight controls, satellites, chemical process controls, telecommunication systems, and nuclear power plants (see, for instance, Mathur [7], Wang [8], Johnson and Julich [9], Sinaki [10], Pandey et al. [11], Coit [12], Hsieh and Hsieh [13], Elerath and Pecht [14], and Wang et al. [15]).
Cold standby systems have recently attracted the attention of many researchers in the field of reliability enginerring (see, e.g., Wang and Ye [16], Ramezani Dobani et al. [17], Danjuma et al. [18], Malhotra et al. [19], and Lin et al. [20]).
In contrast to the residual life of a system, one aspect of engineering systems is their idle time. The idle time is sometimes called the inactivity time or reversed residual lifetime. In view of the idle time, the stochastic properties of coherent systems, a large and well-known class of systems in reliability, have been widely studied during the past decades (see, for instance, Bayramoglu and Ozkut [21], Zhang and Balakrishnan [22], Navarro et al. [23], Kayid et al. [24], Navarro and Calì [25], Salehi and Tavangar [26], Toomaj and Di Crescenzo [27], Amini-Seresht et al. [28], Guo et al. [29], and Kayid and Shrahili [30]). However, the study of stochastic comparisons between idle (or inactive) time of cold standby systems has not been conducted in literature to date.
In this paper, we present results on a failed cold standby system. Two scenarios using different strategies are compared based on their idle time. The first scenario assumes that a cold standby system with n units (with the first unit being the underlying component in the system and the remaining ( n 1 ) components the spare components) has failed before a time t at which the operator found the system to be in failure state, resulting in an idle time on the part of the cold standby system. In the second scenario, we assume that n components were used separately in n independent experiments, in which all components failed before t and the idle time of all components was measured at time t; we then consider the sum of the idle times of the n components. The goal of this work is to derive lower and upper bounds for the idle time of the cold standby system with n components with heterogeneous lifetime distributions by using the sum of the idle time of these n components separately.
The remainder of the paper is divided as follows. Section 2 discusses related research in the relevant fields. In Section 3, preliminary notion and basic formulas and definitions are provided. Section 4 presents the main results of the paper. In Section 5, we conclude the paper with a summary of our results and findings along with further directions for possible future studies.

2. Further Descriptions and Related Works

The concept of stochastic comparisons of the residual life of the convolution of random variables has attracted the attention of many researchers in the context of reliability theory and risk analysis. Thus, Ahmed and Kayid [31] considered the residual lifetime of convolutions of random lifetimes and derived sufficient conditions under which convolution residuals are preserved under the Laplace transform order. Amiripour et al. [32] used folding residuals based on observations from one or two samples to construct a set of stochastic orderings. In this way, they found computable constraints on both the predicted values of the convolution residuals and the survival functions. In addition, their work discussed applications in queueing theory and reliability theory. In the same direction, Kayid and Alshehri [33] recently developed stochastic comparisons between the lifetime of a used cold standby system with a certain age t (which is still working) and the sum of the remaining lifetimes of the components in the system. They used the usual stochastic order and likelihood ratio order to derive their main results. They obtained a result and presented sufficient conditions under which a used cold standby system is less reliable in terms of likelihood ratio order than a cold standby system with used components when the used components have a common age t.
In the context of reversed residual lifetime or inactivity time of the convolution of random variables, the stochastic comparisons obtained in the literature are based on mean inactivity time functions. For example, Ahmad et al. [34] derived a preservation property of the mean inactivity time order under the convolution of random lifetimes. Ortega [35] presented findings that provide guidelines for the total loss amounts for two insurance portfolios under the collective risk model (random sums). In this way, it is possible to analyze the idle time of a cold standby system using the mean values according to the results of Ahmad et al. [34] and Ortega [35]. However, there is a research gap in this area in that there have been no studies analyzing the idle time of cold standby systems using more general distribution measures such as the distribution of inactivity time; thus, there is much room for further research in this area.
In the present paper we consider the idle time of a failed cold standby system to obtain lower and upper bounds for it in terms of the idle time of the failed components in the system. As pointed out and clearly shown by Ahmad et al. [34], the results for the idle variable (the inactivity time) cannot be concluded from the similar results on the residual lifetime variable. Thus, there is room to fill another gap in the literature, which is the starting point for our study in this paper. Another focus is that the properties we obtain in this paper are quite different from and cannot be acquired using the results in Kayid and Alshehri [33]. An interesting point is that, in general, in the remaining lifetime of a functioning coherent system. This is because the idle variable takes values at [ 0 , t ) , while the residual lifetime variable takes values at ( t , + ) ; thus, the former is obviously more predictable than the latter. Therefore, the problem of finding the stochastic bounds of the idle time of a cold standby system has a complementary role in refining our knowledge about the lifetime of the system.
It is worth mentioning that the results obtained in this work play a complementary role compared to the previous works in this field (i.e., Kayid and Alshehri [33]). In that work, the authors were concerned with the remaining lifetime of cold standby systems. In contrast, in the current study we focus on the inactivity time of cold standby systems and the comparison of systems from the point of view of the idle time. The results obtained in this work can be useful in practice for several purposes. The observation time at which a cold standby system is classified as inactive may not correspond exactly to the time at which it actually failed. As a result, there is a time interval during which the system is inactive, which can lead to further costs and losses. Therefore, it is important to control the situation and use an appropriate number of components in the system or even components with a certain reliability level to minimize the idle time of the cold standby system. In this direction, the results of this paper can provide further guidance for engineers to design suitable structures for cold standby systems. The assumptions made in this paper include aging properties of the lifetime distributions of the components of the system along with ordering properties and relationships with the lifetime distributions of the components. Because equipping any system or its components with standby spare parts is a relevant method to increase the reliability of systems with different structures, in the case where a cold standby system with two units or components is considered, the results of this paper may be useful to maintain other kinds of systems to ensure that the main unit is considered as a system with any structure (i.e., not exactly a cold standby system) or a component within it.
The problem of finding stochastic upper and lower bounds for the distribution of convolution of random variables ( S n = i = 1 n X i , see Section 3 for further descriptions), and more generally the mathematical expectations of functions of S n , is of particular interest in the context of risk theory and actuarial analysis. This is particularly useful; it is not plain to derive the distribution function of the convolution of random variables, as they ordinarily have no closed tractable forms. As mentioned by Ramsay [36], while the Pareto distribution is an important candidate for actuaries and economists, an exact expression for the distribution of the sum of n i.i.d. (independent and identically distributed) Pareto random variables is generally difficult to obtain. In the actuarial literature, there is increasing worry about the impact of dependence between individual risks X 1 , , X n on the distribution of the total claim S n . Research by Dhaene et al. [37] has resulted in, among other things, the identification of the portfolio producing the smallest and largest stop-loss premiums, resulting in bounds on E ( S n ) for any arbitrary non-decreasing and convex functions in circumstances of dependence between the X i s. In order to further these findings, Denuit et al. [38] demonstrated how to calculate constraints on P ( S n > s ) , and more broadly on E ( S n ) , for monotone functions that are not always convex.
There has been an increasing interest in evaluating claims and risks in the context of conditional distributions. In risk analysis, the conditional tail expectation is an important metric for right-tailed risk. It indicates the expected level of risk that may occur when an expected risk exceeds a threshold t. Cai and Li [39] studied the convolution and extreme values of dependent risks that follow a multivariate phase type distribution; they derived explicit formulas for a set of conditional tail expectations of the convolution and extreme values for such dependent risks. Their method provided structural information about these distributions while providing novel distributional properties for multivariate phase-type distributions by exploiting the underlying Markovian property of these distributions. In another work by Sordo et al. [40], they studied the marginal behavior of the i-th risk in a risk portfolio in the presence of adversity, such as a disproportionate loss to the portfolio or, in the case of a portfolio with a positive dependence structure, a disproportionate loss to another risk. They formalized the notion that the i-th component of the portfolio is riskier when it is part of a positive-dependent random vector than when it is considered alone, which they did in several ways by considering specific conditional risk distributions. In addition, they acquired conditions under which, given two random vectors with a defined dependence structure, the existence of specific stochastic orderings between their marginals implies an ordering between the corresponding conditional risk distributions.

3. Preliminaries

In the remaining parts of the paper, we use the following notation. Let X ̠ = ( X 1 , , X n ) be a random vector, denote S n = i = 1 n X i , and consider a cold standby system comprising n components. First, one component begins to work and the residual n 1 components are in standby and ready to lie in the system. Upon the failure of the first component, the components that are in queue in standby mode are replaced one by one until all components become inactive and the cold standby system fails. Suppose that X 1 , , X n represent the lifetimes of n described components having cumulative distribution functions (CDFs) F X 1 , , F X n . It is assumed that X 1 , , X n are independent. The lifetime of the cold standby system is then identified as
S n = X 1 + X 2 + + X n .
Although in this paper we use the random variable (rv) S n in (1) as the lifetime of an n-fold cold standby system, there is another description for this rv from the perspective of insurance and risk theory. In such frameworks, convolution manifests itself naturally. In this case, the portfolio consists of a fixed number of different insurance policies and the total loss of the portfolio is the sum (convolution) of the random losses of the individual policies, which is consistent with the model of individual risk. For example, we are interested in how the sum S n of claims is distributed across different insurance policies, where X i , i = 1 , 2 , , n represents the payout on policy i. It is assumed that the risks X i are independent random variables. The risks should be combined into one term in (1) if this assumption is broken for certain risks, such as fire insurance policies for different floors of the same building. The CDF of the lifetime of the cold standby system is
F S n ( t ) = P ( X 1 + X 2 + + X n t ) = F X 1 ( t ) F X 2 ( t ) F X n ( t ) ,
in which ∗ stands for the convolution operator. It is acknowledged that when X i and X j , for i j are independent, then F X i ( t ) F X j ( t ) = + F X i ( t x ) f X j ( x ) d x , where f X j is the probability density function (PDF) of X j , which is the CDF of the convolution of X i and X j , that is, the CDF of X i + X j . From (2), we can develop the following:
F S n ( t ) = F S n 1 ( t ) F X n ( t ) = + F S n 1 ( t x ) f X n ( x ) d x .
Suppose that X denotes the life length of a lifetime organism. We assume that at the time t at which an inspection is carried out, it is found that the organism is not alive or the system is not working. This situation is frequently encountered in different contexts; there is no process to accurately determine the time point at which the organism failed, though there may be signs from which can be realized that the organism has failed. There are many situations in which the observation of events is postponed. Thus; the time t may be the first time at which a sign has observed. We utilize the rv X ( t ) = ( t X | X t ) , which is well-defined for every t 0 for which F X ( t ) > 0 . The rv X ( t ) is called the inactivity time of the organism (which has a random lifetime X) at time t. The rv X ( t ) has the following CDF.
F X ( t ) ( x ) = 0 , x < 0 1 F X ( t x ) F X ( t ) , 0 x < t 1 , x t
The associated reliability function of X ( t ) is obviously
F ¯ X ( t ) ( x ) = 1 , x < 0 F X ( t x ) F X ( t ) , 0 x < t 0 , x t
and the PDF of X ( t ) is derived by taking derivation of Equation (4), as shown below.
f X ( t ) ( x ) = f X ( t x ) F X ( t ) : 0 x < t 0 : x t or x < 0
Note that F X ( t ) is the normalizing constant, as in view of Equation (6) we have F X ( t ) = 0 t f X ( t x ) d x . There are two well-known reliability measures which are constructed using the rv X ( t ) , namely, the reversed hazard rate (RHR) function and the mean inactivity (MIT) time function. In view of (6), the RHR of a lifetime rv ( F X ( 0 ) = 0 ) is defined as
h ˜ X ( t ) = f X ( t ) ( 0 ) = f X ( t ) F X ( t ) , for all t : F X ( t ) > 0 .
The MIT function of X, as the mathematical expectation of the rv X ( t ) , is derived as follows:
m ˜ X ( t ) = E [ X ( t ) ] = 0 t F X ( x ) d x F X ( t ) , for all t : F X ( t ) > 0 .
For the preliminary properties of the RHR function, we refer readers to Block et al. [41] and Finkelstein [42]; for the initial aspects and properties of MIT functions, see Kayid and Izadkhah [43] and Khan et al. [44].
Stochastic orders which have been utilized to compare probability distributions provide useful procedures for comparing reliability systems. Two reputable and frequently used stochastic orders are adopted in this paper to construct stochastic orders between the idle times of inactive systems. The following definition is adopted from Shaked and Shanthikumar [45]. Suppose that X and Y have CDFs F X and F Y , respectively, for which the survival functions (SFs) of X and Y are defined as F ¯ X 1 F X and F ¯ Y 1 F Y , respectively.
Definition 1.
Suppose that X and Y are two non-negative rvs with PDFs f X and f Y and survival functions F ¯ X and F ¯ Y , respectively. Then, we say that X is smaller than or equal to Y in:
(i) the likelihood ratio order (denoted as X l r Y ) if f Y ( t ) f X ( t ) is increasing in t 0 ;
(ii) the usual stochastic order (denoted as X s t Y ) if F ¯ X ( t ) F ¯ Y ( t ) for all t 0 .
The two stochastic orders provided in Definition 1 are in a relation with each other such that X l r Y yields X s t Y (for an example, see Theorem 1.C.1 in Shaked and Shanthikumar [45]). The usual stochastic ordering is useful for comparing the reliability of two systems directly and completely in the whole time interval. On the other hand, the likelihood ratio ordering is a powerful tool for comparing the strengths of random variables such that X l r Y holds if and only if
[ X | a < X b ] s t [ Y | a < Y b ] for all a < b ,
that is, the likelihood ratio order is able to compare two systems with lifetimes X and Y based on their reliability functions at specific times. The likelihood ratio order is useful for constructing rejection regions when testing certain statistical hypotheses in a parametric family of distribution in order to choose between two values of the parameter. For more properties and details on these stochastic orders, we refer readers to Shaked and Shanthikumar [45].
New classes of lifetime distributions can be generated in accordance with the comparison between X ( t 1 ) and X ( t 2 ) for all t 1 t 2 R + according to the likelihood ratio order and the usual stochastic order. In the sequel to the above-cited paper, the following classes are used.
Definition 2.
The rv X with PDF f X is said to have the following:
(i) The increasing likelihood ratio property (denoted by X I L R ) whenever f X ( t ) is log-concave in t 0 ;
(ii) A decreasing reversed hazard rate (denoted by X D R H R ) whenever F X ( t ) is log-concave in t 0 .
For instance, as a standard lifetime distribution, the exponential distribution fulfills both the I L R and D R H R properties. The Weibull distribution with a shape parameter α , scale parameter λ , and reliability function (SF) F ¯ X ( t ) = exp ( ( λ t ) α ) has the I L R and D R H R properties if α > 1 . For further properties of the I L R and the D R H R classes of lifetime distributions, readers are referred to Lai and Xie [46]. The following definition is from to Karlin [47].
Definition 3.
Let g ( x , y ) be a non-negative function defined for x X R and y Y R ; then, g ( x , y ) is said to be totally positive with order 2 (denoted as T P 2 ) in ( x , y ) X × Y provided that g ( x 1 , y 1 ) g ( x 2 , y 2 ) g ( x 1 , y 2 ) g ( x 2 , y 1 ) for all x 1 x 2 X and for all y 1 y 2 Y .

4. Main Results

Our main results are stated in this section. It is assumed that while the failure of the cold standby system is recognized at time t, the actual time of failure is a time prior to t. The idle time of the inactive cold standby system is measured as the time between the exact time of failure, which is a random variable, and the time t. Here, we use the idle times of the components of the system to obtain lower and upper bounds on the lifetime of the standby system within which they are assembled. Specifically, we show that the idle time of a failed cold standby system with n components at time t is greater than the sum of the idle times of the components in the system minus ( n 1 ) t in the sense of the usual stochastic ordering. The idle time of a cold standby system with n components (one of which active with a random lifetime X 1 and the remaining inactive ones n 1 with random lifetimes X 2 , , X n are ready to function upon the failure of the active component) is characterized by the rv:
( S n ) ( t ) : = ( t S n S n t ) , for all t : F S n ( t ) > 0
where t is the time at which the failure of the system is first observed. The results obtained in this paper are derived based on techniques in probability and distribution theory, including the total probability formula.

4.1. Usual Stochastic Order-Based Bounds for the Idle Time of Cold Standby Systems with n Components

In the following theorem we derive a lower bound for the inactivity time of a standby system, in the sense of the usual stochastic order, in terms of the inactivity time of its components.
Theorem 1.
Let X 1 , X 2 , , X n be independent and non-negative rvs such that ( X 1 ) ( t ) , ( X 2 ) ( t ) , , ( X n ) ( t ) are independent as well; then, for fixed t 0 ,
i = 1 n X i ( t ) s t i = 1 n ( X i ) ( t ) ( n 1 ) t .
Proof. 
We proceed to prove the above theorem using the method of induction. Let n = 2 and denote W n = ( i = 1 n X i ) ( t ) and V n = i = 1 n ( X i ) ( t ) ( n 1 ) t , where t 0 is a fixed time. First, we show that F ¯ W 2 ( a ) F ¯ V 2 ( a ) for all a R . Because for every n N , S W n = [ 0 , t ] and S V n = [ ( n 1 ) t , t ] , we have F ¯ W 2 ( a ) F ¯ V 2 ( a ) for all a 0 , as well as for all a t . This is sufficient to show that F ¯ W 2 ( a ) F ¯ V 2 ( a ) holds true for all a [ 0 , t ] , which in turn is sufficient to claim that
W 2 : = ( X 1 + X 2 ) ( t ) s t ( X 1 ) ( t ) + ( X 2 ) ( t ) t : = V 2 .
For a [ 0 , t ] , we can obtain
F ¯ W 2 ( a ) = F X 1 + X 2 ( t a ) F X 1 + X 2 ( t ) = 0 t a F X 2 ( t a x 1 ) f X 1 ( x 1 ) d x 1 0 t F X 2 ( t x 1 ) f X 1 ( x 1 ) d x 1 = a t F X 2 ( x a ) f X 1 ( t x ) d x 0 t F X 2 ( x ) f X 1 ( t x ) d x ,
where the first identity follows from Equation (4), the second is obtained using the total probability formula along with the fact that X 1 and X 2 are independent, and the third is acquired after changing of variable x = t x 1 . On the other hand,
F ¯ V 2 ( a ) = P ( ( X 1 ) ( t ) + ( X 2 ) ( t ) > t + a ) = 0 t F ¯ ( X 2 ) ( t ) ( a + t x 1 ) f ( X 1 ) ( t ) ( x 1 ) d x 1 = a t F X 2 ( x 1 a ) f X 1 ( t x 1 ) d x 1 F X 1 ( t ) F X 2 ( t ) ,
in which the second equality is due to the total probability formula, ( X 1 ) ( t ) and ( X 2 ) ( t ) are independent, and the second equality is obtained using Equations (5) and (6). Because we have F X 2 ( x ) F X 2 ( t ) for x t ,
0 t F X 2 ( x ) f X 1 ( t x ) d x 0 t F X 2 ( t ) f X 1 ( t x ) d x = F X 2 ( t ) 0 t f X 1 ( t x ) d x = F X 2 ( t ) F X 1 ( t ) .
Therefore, for all a [ 0 , t ] ,
F ¯ W 2 ( a ) = a t F X 2 ( x a ) f X 1 ( t x ) d x 0 t F X 2 ( x ) f X 1 ( t x ) d x a t F X 2 ( x a ) f X 1 ( t x ) d x F X 2 ( t ) F X 1 ( t ) = F ¯ V 2 ( a ) .
Let us assume now that (8) holds for n = m , that is,
i = 1 m X i ( t ) s t i = 1 m ( X i ) ( t ) ( m 1 ) t .
We can now prove that (8) holds for n = m + 1 . We observe that
i = 1 m + 1 X i ( t ) = s t i = 1 m X i + X m + 1 ( t ) s t i = 1 m X i ( t ) + ( X m + 1 ) ( t ) t s t i = 1 m ( X i ) ( t ) ( m 1 ) t + ( X m + 1 ) ( t ) t = s t i = 1 m + 1 ( X i ) ( t ) m t ,
where the first stochastic order is due to (9), the second stochastic order follows from (10), and = s t means the equality in the distribution. Thus, the proof is validated. □
The lower bound in (8) in Theorem 1 can take negative values for certain t 0 . If the lower bound is negative for a given t 0 , the result of Theorem 1 becomes trivial; however, in the following example we present a situation in which (8) produces a meaningful lower bound for the MIT of a gamma-distributed random lifetime.
Example 1.
Suppose that X i E ( λ ) , i = 1 , 2 , an exponential distribution with mean 1 / λ i . Then, X i has MIT
m ˜ X i ( t ) = t 1 exp ( λ t ) 1 λ .
It is known that X 1 + X 2 has a gamma distribution with shape α = 2 and scale λ. From Theorem 1, as the usual stochastic order implies the expectation order, we obtain a lower bound for the MIT of X 1 + X 2 , as follows:
E ( X 1 + X 2 ) ( t ) E ( ( X 1 ) ( t ) ) + E ( ( X 2 ) ( t ) ) t = m ˜ X 1 ( t ) + m ˜ X 2 ( t ) t = 2 t 1 exp ( λ t ) 2 λ t .
We show that the obtained lower bound for the MIT of X 1 + X 2 is non-negative. It can be readily seen that 2 t 1 exp ( λ t ) 2 λ t 0 for all t 0 if and only if ( 2 + λ t ) exp ( λ t ) ( 2 λ t ) 0 for all t 0 . Because exp ( x ) ( 1 + x ) for all x 0 , it is the case that 1 ( 1 + x ) exp ( x ) 0 for all x 0 .
Therefore,
( 2 + λ t ) exp ( λ t ) ( 2 λ t ) = 0 λ t ( 1 ( 1 + x ) exp ( x ) ) d x 0 , f o r a l l t 0 .
The following example clarifies another utilization of the result of Theorem 1.
Example 2.
We say that X has a gamma distribution with shape parameter α > 0 and the scale parameter λ and denote it by X G ( α , λ ) whenever X has a PDF f X ( x ) = λ α x α 1 e λ x Γ ( α ) . Considering two lifetime organisms or devices working one after another in a system (a standby structure) and letting X i denote the lifetime of the ith organism, we can consider two situations for i = 1 , 2 : first, when both organisms fail before time t = 1 , and second when the system fails before time t = 1 . Suppose that X 1 G ( 2 , 3 ) and X 2 G ( 3 , 3 ) . Note that if X G ( k , λ ) , where k N , the the CDF of X is derived via
F X ( x ) = 1 n = 0 k exp ( λ x ) ( λ x ) n n ! .
Denote P 4 ( a ) = 27 a 4 144 a 3 + 306 a 2 312 a + 131 . In the spirit of the Equation (11), we find the CDF of the rv W 2 : = ( X 1 + X 2 ) ( t ) when t = 1 as follows:
F ¯ W 2 ( a ) = 0 1 a F X 2 ( 1 a x ) f X 1 ( x ) d x 0 1 F X 2 ( 1 x ) f X 1 ( x ) d x = P 4 ( a ) exp ( 3 ( a 1 ) ) 8 131 exp ( 3 ) 8 ,
On the other hand, from (11), the rv V 2 : = ( X 1 ) ( t ) + ( X 2 ) ( t ) t for t = 1 has the following SF:
F ¯ V 2 ( a ) = a 1 F X 2 ( x a ) f X 1 ( 1 x ) d x F X 1 ( 1 ) F X 2 ( 1 ) = P 4 ( a ) exp ( 3 a ) 8 exp ( 3 ) 8 ( 4 exp ( 3 ) ) ( 68 exp ( 3 ) ) .
From Theorem 1, W 2 s t V 2 ; thus, F ¯ W 2 ( a ) F ¯ V 2 ( a ) for all a R . Figure 1 plots the graphs of F ¯ W 2 ( a ) and F ¯ V 2 ( a ) for a [ 0 , 1 ] (for the values out of [ 0 , 1 ] , the ordering relation is obviously fulfilled) to exhibit the stochastic ordering property.

4.2. Likelihood Ratio Order-Based Bounds for the Idle Time of Cold Standby Systems with n Components

Before stating the next result, we need to introduce additional notation. We assume that X i ( t ) : = t ( X i ) ( t ) , which is known in the literature as the past lifetime of X i , i = 1 , 2 . Note that X i ( t ) has a distribution which corresponds to the conditional distribution of X i , given that X i t for any i = 1 , 2 . In what follows, we take
S n = i = 1 n X i S n ( t ) = i = 1 n ( X i ) ( t i ) ( S n ) ( t ) = ( i = 1 n X i ) ( t ) S n ( t ) = i = 1 n X i | i = 1 n X i t S n , t = i = 1 n X i ( t i ) .
In the following result, it is demonstrated that at a certain time t, for a cold standby system where the system and all the components in it are inactive, the overall idle time of the components is stochastically greater (with respect to likelihood ratio order) than the idle time of the cold standby unit.
Theorem 2.
Let X 1 , X 2 , , X n be independent rvs such that X n follows an exponential distribution with parameter λ n . In addition, let ( X 1 ) ( t ) , ( X 2 ) ( t ) , , ( X n ) ( t ) be independent for a fixed t 0 . Then,
( i = 1 n X i ) ( t ) l r i = 1 n ( X i ) ( t ) .
Proof. 
Notice that ( S n ) ( t ) : = ( i = 1 n X i ) ( t ) has support [ 0 , t ] , while S n ( t ) : = i = 1 n ( X i ) ( t ) has support [ 0 , n t ] . Thus, we need to prove that f S n ( t ) ( s ) f ( S n ) ( t ) ( s ) is increasing in s 0 for every s t , as for s > t we have f S n ( t ) ( s ) f ( S n ) ( t ) ( s ) = + . Thus, we have
f ( S n ) ( t ) ( s ) = f S n ( t s ) F S n ( t ) I [ 0 s t ] , and f S n ( t ) ( s ) = 0 + f ( X n ) ( t ) ( s y ) f S n 1 ( t ) ( y ) d y .
Using Equation (6) and then applying the convolution formula on the density function of S n , for every s [ 0 , t ) we obtain
f ( S n ) ( t ) ( s ) = f S n ( t s ) F S n ( t ) = 0 + f X n ( t s y ) f S n 1 ( y ) d y F S n ( t ) .
Next, by imposing the convolution formula on the density function of S n ( t ) , we have
f S n ( t ) ( s ) = 0 + f X n ( t ) ( s y ) f S n 1 ( t ) ( y ) d y .
Therefore,
f S n ( t ) ( s ) f ( S n ) ( t ) ( s ) = F S n ( t ) . 0 + f X n ( t ) ( s y ) f S n 1 ( t ) ( y ) d y 0 + f X n ( t s y ) f S n 1 ( y ) d y = F S n ( t ) F X n ( t ) . 0 s f X n ( t s + y ) f S n 1 ( t ) ( y ) d y 0 t s f X n ( t s y ) f S n 1 ( y ) d y = F S n ( t ) F X n ( t ) . 0 s f X n ( t s + y ) f S n 1 ( t ) ( y ) d y s t f X n ( u s ) f S n 1 ( t u ) d u ,
where a change in the variable u = t y is made to derive the last equality. Because X n E ( λ n ) ,
f S n ( t ) ( s ) f ( S n ) ( t ) ( s ) = F S n ( t ) F X n ( t ) . 0 s λ n exp ( λ n ( t s + y ) ) f S n 1 ( t ) ( y ) d y s t λ n exp ( λ n ( u s ) ) f S n 1 ( t u ) d u = exp ( λ n t ) . F S n ( t ) F X n ( t ) . 0 s exp ( λ n y ) f S n 1 ( t ) ( y ) d y s t exp ( λ n u ) f S n 1 ( t u ) d u .
Hence, for all 0 s t we obtain
s log f S n ( t ) ( s ) f ( S n ) ( t ) ( s ) = s log 0 s exp ( λ n y ) f S n 1 ( t ) ( y ) d y s t exp ( λ n u ) f S n 1 ( t u ) d u = exp ( λ n s ) f S n 1 ( t ) ( s ) 0 s exp ( λ n y ) f S n 1 ( t ) ( y ) d y + exp ( λ n s ) f S n 1 ( t s ) s t exp ( λ n y ) f S n 1 ( t y ) d y ,
which is non-negative. Thus, the proof of theorem is completed. □
We provide a situation to examine the result of Theorem 2 in Example 3 below.
Example 3.
Suppose that X 1 E ( λ ) and X 2 E ( 2 λ ) with λ > 0 . Following Arnold and Villaseñor [48], we can deduce that S 2 : = X 1 + X 2 has a PDF
f S 2 ( s ) = 2 λ exp ( λ s ) ( 1 exp ( λ s ) )
and CDF
F S 2 ( s ) = 1 2 exp ( λ s ) + exp ( 2 λ s ) .
For all w ( 0 , t ) , the rv W 2 : = ( X 1 + X 2 ) ( t ) has a PDF
f W 2 ( w ) = 2 λ 1 2 exp ( λ t ) + exp ( 2 λ t ) ( exp ( λ ( t w ) ) exp ( 2 λ ( t w ) ) ) .
The rv W 3 = ( X 1 ) ( t ) + ( X 2 ) ( t ) has a PDF
f W 3 ( w ) = 2 λ exp ( 3 λ t ) ( 1 + exp ( λ t ) ) ( 1 exp ( λ t ) ) 2 ( exp ( 2 λ w ) exp ( λ w ) ) .
Therefore, W 2 l r W 3 if and only if
R λ ( w , t ) = exp ( 2 λ w ) exp ( λ w ) exp ( λ ( t w ) ) exp ( 2 λ ( t w ) ) .
Let us choose λ = 4 and t = 2 . We show in Figure 2 that R 4 ( w , 2 ) is an increasing function. This confirms the result of Theorem 2.
Consider a cold standby system composed of a single component with a general continuous lifetime distribution equipped with one additional component with an exponential distribution lifetime. In this case, it can be realized from Theorem 2 that the idle time of the cold standby system is smaller with respect to the likelihood ratio order than the sum of the inactivity times of both components measured at a specified time t. Note that the time t is considered to be the time at which the system and its components are inactive and not functioning.
The following technical lemma is useful and is applied in the following.
Lemma 1.
Suppose that τ 1 , τ 2 , , τ m are m points in time with a mean τ ¯ and that X 1 , X 2 , , X m are m non-negative rvs; then, m τ ¯ ( S m ) ( m τ ¯ ) = s t S m ( τ ) , where = s t refers to the equality in the distribution.
Theorem 3.
Let X 1 , X 2 , X m be independent non-negative rvs such that X 1 ( t 1 ) , X 2 ( t 2 ) , , X m ( t m ) and X 1 ( τ 1 ) , X 2 ( τ 2 ) , , X n ( τ n ) , where m > n are independent and where t 1 , t 2 , , t m are m fixed time points, and as such are τ 1 , τ 2 , , τ n . Let X i I L R , i = 1 , 2 , , n , then if
(i) 
m t ¯ n τ ¯ , where t m n τ ¯ , in which τ ¯ = i = 1 n τ i n and t ¯ = i = 1 m t i m ,
(ii) 
X m and X n have identical distributions, and
(iii) 
i = 1 m 1 X i ( t i ) l r i = 1 n X i for t i 0 , i = 1 , 2 , , m ,
We have
( i = 1 n X i ) ( n τ ¯ ) l r i = 1 m ( X i ) ( t i ) m t ¯ + n τ ¯ .
Proof. 
We first prove that S n ( n τ ¯ ) : = ( i = 1 n X i ) ( n τ ¯ ) l r i = 1 m ( X i ) ( t i ) : = S m , t . The result is then proved following our discussions here. From Theorem 1.C.8 in Shaked and Shanthikumar [45], if ψ is a decreasing function, then X l r Y implies that ψ ( X ) l r ψ ( Y ) . Thus, if ψ ( x ) = m t ¯ x , because S n ( n τ ¯ ) l r S m , t , it follows that m t ¯ S n ( n τ ¯ ) l r m t ¯ S m , t . Using Lemma 1, it can be realized that m t ¯ S n ( n τ ¯ ) = s t m t ¯ n τ ¯ + ( S n ) ( n τ ¯ ) ) , and in addition that m t ¯ S m , t = s t S m ( t ) . Hence, it follows that ( S n ) ( n τ ¯ ) l r S m ( t ) m t ¯ + n τ ¯ . Thus, it is sufficient to prove that f S m , t ( s ) f S n ( n τ ¯ ) ( s ) is increasing in 0 < s n τ ¯ . We assume that I [ x A ] is the indicator function of the set [ x A ] , which is equal to one if x A and is equal to 0 if x A c , where A c is the complement of the set A. For every s ( 0 , n τ ¯ ] , we can write
f S m , t ( s ) f S n ( n τ ¯ ) ( s ) = F S n ( n τ ¯ ) 0 + f X m ( t m ) ( s y ) f S m 1 , t ( y ) d y 0 + f X n ( s y ) f S n 1 ( y ) d y = F S n ( n τ ¯ ) F X m ( t m ) . 0 + f X m ( s y ) I [ s y t m ] f S m 1 , t ( y ) I [ y > 0 ] d y 0 + f X n ( s y ) f S n 1 ( y ) d y = F S n ( n τ ¯ ) F X m ( t m ) . ( s t m ) 0 + f X m ( s y ) f S m 1 , t ( y ) d y 0 + f X n ( s y ) f S n 1 ( y ) d y = F S n ( n τ ¯ ) F X m ( t m ) . 0 + f X m ( s y ) f S m 1 , t ( y ) d y 0 + f X n ( s y ) f S n 1 ( y ) d y ,
where a b stands for the maximum of a and b and the last identity follows from the fact that for all s ( 0 , n t ¯ ] , from assumption (i) above we have s t m s n t ¯ 0 , meaning that ( s t m ) 0 = 0 . Therefore, because X m and X n are identical in distribution (assumption (ii)), for every s ( 0 , n t ¯ ] we have
f S m , t ( s ) f S n ( n τ ¯ ) ( s ) = F S n ( n τ ¯ ) F X m ( t m ) . 0 + f X m ( s y ) f X n ( s y ) . f S m 1 , t ( y ) f S n 1 ( y ) f X n ( s y ) f S n 1 ( y ) 0 + f X n ( s y ) f S n 1 ( y ) d y d y = F S n ( n τ ¯ ) F X m ( t m ) 0 + f S m 1 , t ( y ) f S n 1 ( y ) f X n | S n = s ( s y | s ) d y = F S n ( n τ ¯ ) F X m ( t m ) 0 + Ψ ( y ) f S n 1 | S n = s ( y | s ) d y = F S n ( n τ ¯ ) F X m ( t m ) E Ψ ( S n 1 ) S n = s ,
where Ψ ( y ) = f S m 1 , t ( y ) f S n 1 ( y ) . From assumption (iii), X i I L R for all i = 1 , 2 , , n ; thus, because the convolution of log-concave densities is log-concave, S n 1 I L R . From Theorem 1.C.53 of Shaked and Shanthikumar [45], we conclude that
[ S n 1 | S n = s 1 ] l r [ S n 1 | S n = s 2 ] , for all s 1 s 2 R + ,
Moreover, because l r implies that s t , we have
[ S n 1 | S n = s 1 ] s t [ S n 1 | S n = s 2 ] for all s 1 s 2 R + .
Furthermore, from assumption (iii), the function Ψ ( y ) is increasing in y > 0 . From (13) and (14), it follows that f S m , t ( s ) f S n ( n τ ¯ ) ( s ) is increasing in s > 0 , which validates the proof. □
The following example shows that the conditions in Theorem 3 are accessible.
Example 4.
Choose m = 3 and n = 2 such that t 1 = 1 , t 2 = 2 , t 3 = 1.5 and τ 1 = 0.25 , τ 2 = 1 . It can be readily seen that m t ¯ > n τ ¯ and t m > n τ ¯ , that is, condition (i) in Theorem 3 holds. Further, let X i U ( 0 , 2 ) , i = 1 , 2 , 3 , i.e., the X i s are distributed uniformly over ( 0 , 2 ) . Thus, X 3 and X 2 are equal in distribution, and condition (ii) in Theorem 3 is satisfied. It can be seen that f X i ( x ) = I [ 0 < x < 2 ] / 2 is log-concave in x, i.e., X i I L R , for all i = 1 , 2 , 3 ; therefore, another sufficient condition in Theorem 3 holds true. It is not hard to prove that X i ( t i ) : = ( X i | X i t i ) U ( 0 , t i ) , i = 1 , 2 , 3 . In addition, we can prove after calculation that
f X 1 ( t 1 ) + X 2 ( t 2 ) ( s ) = s t 1 t 2 · I [ 0 < s t 1 ] + 1 t 2 · I [ t 1 < s t 2 ] + t 1 + t 2 s t 1 t 2 · I [ t 2 < s t 1 + t 2 ] .
It is easily observable that f X 1 ( t 1 ) + X 2 ( t 2 ) ( s ) / f X 1 ( s ) is non-decreasing in s ( 0 , 2 ) , meaning that condition (iii) in Theorem 3 is valid. Therefore, as follows from Theorem 3, we can conclude that the ordering relation provided in (12) is satisfied.

4.3. Further Bounds for the Idle Time of Cold Standby Systems with 2 Components

Cold standby systems with two components are very important in reliability and systems analysis. This is because redundancy methods usually assume that there is only one spare part for certain components of a given system with a specified structure, as the first unit is considered the main working unit and the second component the standby unit. The following lemma is useful in proving the next result.
Lemma 2.
Let X 1 , X 2 , , X m be m dependent rvs which are non-negative; further, let X i ( τ i ) , i = 1 , 2 , , m be independent. Then,
i = 1 m X i ( τ i ) = s t ( i = 1 m X i X 1 τ 1 , , X m τ m ) ,
in which τ 1 , , τ m are m points of time such that i = 1 m F X i ( τ i ) > 0 .
Proof. 
It suffices to prove that S m ( τ ) : = i = 1 m X i ( τ i ) and ( S m X i τ i , i = 1 , , m ) have a common moment generating function. Denote X = ( X 1 , , X m ) and let ( X | X i τ i , i = 1 , , m ) have a conditional PDF f ( X | X i τ i , i = 1 , , m ) . Because the X i s are independent, for all x = ( x 1 , , x m ) R m we have
f ( X | X i τ i , i = 1 , , m ) ( x 1 , , x m ) = f X ( x ) . I [ x 1 τ 1 , , x m τ m ] P ( X 1 τ 1 , , X m τ m ) = i = 1 m f X i ( x i ) F X i ( τ i ) I [ x 1 τ 1 , , x m τ m ] .
Now, we can write
M ( S m X i τ i , i = 1 , , m ) ( t ) = E ( exp ( t S m ) | X i τ i , i = 1 , , m ) = E ( i = 1 m exp ( t X i ) X i τ i , i = 1 , , m ) = 0 + 0 + i = 1 m exp ( t x i ) f ( X | X i τ i , i = 1 , , m ) ( x 1 , , x m ) d x m d x 1 = 0 τ 1 0 τ m i = 1 m exp ( t x i ) f X i ( x i ) F X i ( τ i ) = i = 1 m 0 τ i exp ( t x i ) f X i ( x i ) F X i ( τ i ) d x i = i = 1 m E ( exp ( t X i ( τ i ) ) ) = M S m ( τ ) ( t ) , f o r a l l t R ,
where the last identity follows from the assumption that X 1 ( τ 1 ) , , X m ( τ m ) are independent. The proof is completed. □
The following result presents a sufficient condition for the usual stochastic ordering between the idle time of an inactive standby system of size two and the sum of the idle times of the inactive components. It is worth mentioning that as standby systems of size two are very important as an effective redundancy method in engineering reliability systems, the previous results are of particular interest when n = 2 .
Theorem 4.
Let X 1 and X 2 be two independent rvs such that ( X 1 ) ( τ 1 ) and ( X 2 ) ( τ 2 ) are independent for τ 1 τ 2 as two specified points of time. Suppose that h ˜ X 2 ( s τ 1 ) h ˜ X 1 + X 2 ( s ) , for all s [ τ 1 , τ 1 + τ 2 ] ; then,
( X 1 + X 2 ) ( τ 1 + τ 2 ) s t ( X 1 ) ( τ 1 ) + ( X 2 ) ( τ 2 ) .
Proof. 
In a similar manner as in the proof of Theorem 3, it is sufficient to show that ( S 2 ) ( τ 1 + τ 2 ) s t S 2 , τ . From Lemma 2, when m = 2 , because X 1 and X 2 as well as X 1 ( τ 1 ) and X 2 ( τ 2 ) are independent, we have S 2 , τ = s t ( S 2 X 1 τ 1 , X 2 τ 2 ) . Thus, we can prove that
( S 2 ) ( τ 1 + τ 2 ) s t ( S 2 X 1 τ 1 , X 2 τ 2 ) .
By routine calculation, it is evident that (15) is satisfied if and only if
P ( S 2 s S 2 τ 1 + τ 2 ) P ( S 2 s X 1 τ 1 , X 2 τ 2 ) , for all s ( 0 , τ 1 + τ 2 ] ,
which holds if and only if
P ( X 1 τ 1 , X 2 τ 2 S 2 τ 1 + τ 2 ) P ( X 1 τ 1 , X 2 τ 2 S 2 s ) for all s ( 0 , τ 1 + τ 2 ] .
The inequality in (16) holds true for s ( 0 , τ 1 ] , as it can be obviously seen that
P ( X 1 τ 1 , X 2 τ 2 S 2 τ 1 + τ 2 ) = P ( X 1 τ 1 , X 2 τ 2 ) P ( S 2 τ 1 + τ 2 ) P ( X 1 τ 1 , X 2 τ 2 ) P ( S 2 s ) = P ( X 1 τ 1 , X 2 τ 2 S 2 s ) .
Thus, we only need to prove that the inequality in (16) is satisfied for s ( τ 1 , τ 1 + τ 2 ] . Note that
0 τ 2 f X 2 ( x 2 ) I [ x 2 s x 1 ] F S 2 ( s ) d x 2 = P ( X 2 ( s x 1 ) τ 2 ) F X 2 ( s x 1 ) = F X 2 ( ( s x 1 ) τ 2 ) ,
where a b = min { a , b } . Thus, we can obtain
P ( X 1 τ 1 , X 2 τ 2 S 2 s ) = 0 τ 1 0 τ 2 f X 1 ( x 1 ) f X 2 ( x 2 ) I [ x 1 + x 2 s ] F X 1 + X 2 ( s ) d x 2 d x 1 = 0 τ 1 f X 1 ( x 1 ) 0 τ 2 f X 2 ( x 2 ) I [ x 2 s x 1 ] F X 1 + X 2 ( s ) d x 2 d x 1 = 0 τ 1 f X 1 ( x 1 ) F X 2 ( ( s x 1 ) τ 2 ) F X 1 + X 2 ( s ) d x 1 .
Therefore, to prove (15) it is sufficient to show the following for all s ( τ 1 , τ 1 + τ 2 ] :
0 τ 1 f X 1 ( x 1 ) F X 2 ( ( s x 1 ) τ 2 ) F S 2 ( s ) d x 1 0 τ 1 f X 1 ( x 1 ) F X 2 ( ( τ 1 + τ 2 x 1 ) τ 2 ) F S 2 ( τ 1 + τ 2 ) d x 1 .
Because we have ( τ 1 + τ 2 x 1 ) τ 2 = τ 2 for all x 1 τ 1 , it suffices to prove that
0 τ 1 f X 1 ( x 1 ) F X 2 ( ( s x 1 ) τ 2 ) F S 2 ( s ) d x 1 0 τ 1 f X 1 ( x 1 ) F X 2 ( τ 2 ) F S 2 ( τ 1 + τ 2 ) d x 1
holds for all s ( τ 1 , τ 1 + τ 2 ] , that is, it is enough to demonstrate that for all s ( τ 1 , τ 1 + τ 2 ] we have
0 τ 1 f X 1 ( x 1 ) Φ ( x 1 , s , τ 1 , τ 2 ) d x 1 0 ,
where
Φ ( x 1 , s , τ 1 , τ 2 ) = F X 2 ( ( s x 1 ) τ 2 ) F S 2 ( s ) F X 2 ( τ 2 ) F S 2 ( τ 1 + τ 2 ) .
Let us assume that τ 1 s < τ 2 ; then, we can show that
0 τ 1 f X 1 ( x ) Ψ ( x 1 , s , τ 1 , τ 2 ) d x 1 0 , for all s [ τ 1 , τ 2 ) .
Because s < τ 2 , it is the case that s x 1 τ 2 x 1 τ 2 for all x 1 ( 0 , τ 1 ) ; hence, ( s x 1 ) τ 2 = s x 1 . Therefore,
Ψ ( x 1 , s , τ 1 , τ 2 ) = F X 2 ( s x 1 ) F S 2 ( s ) F X 2 ( τ 2 ) F S 2 ( τ 1 + τ 2 ) F X 2 ( s τ 1 ) F S 2 ( s ) F X 2 ( τ 2 ) F S 2 ( τ 1 + τ 2 ) ,
which is non-negative if F X 2 ( s τ 1 ) F S 2 ( s ) is decreasing in s [ τ 1 , τ 2 ) . This is additionally satisfied if the assumption that h ˜ X 2 ( s τ 1 ) h ˜ X 1 + X 2 ( s ) for all s [ τ 1 , τ 1 + τ 2 ] holds. Now, assuming that τ 2 s < τ 1 + τ 2 ,
0 s τ 2 Ψ ( x 1 , s , τ 1 , τ 2 ) d x 1 0 s τ 2 F X 2 ( τ 2 ) f X 1 ( x 1 ) 1 F S 2 ( s ) 1 F S 2 ( τ 1 + τ 2 ) d x 1 0 .
In a similar manner to the case when τ 1 s 2 < τ 2 , we can now establish that
s τ 2 τ 1 Ψ ( x 1 , s , τ 1 , τ 2 ) d x 1 0 .
As a result, we have 0 τ 1 Ψ ( x 1 , s , τ 1 , τ 2 ) d x 1 0 for all s [ τ 2 , τ 1 + τ 2 ] . The proof of the theorem is now completed. □
In the context of the conditions of Theorem 4, it is possible to question whether the assumption that h ˜ X 2 ( s τ 1 ) h ˜ X 1 + X 2 ( s ) for all s [ τ 1 , τ 1 + τ 2 ] is attainable. The following remark clarifies this issue.
Remark 1.
Suppose that X 1 and X 2 respectively represent the lifetime of a component and the lifetime of the standby unit which, are assumed to be independent. Note that for all x < 0 we have f X i ( x ) = F X i ( x ) = 0 , i = 1 , 2 . We can write
h ˜ X 1 + X 2 ( s ) : = f X 1 + X 2 ( s ) F X 1 + X 2 ( s ) = 0 + f X 2 ( s x 1 ) f X 1 ( x 1 ) d x 1 0 + F X 2 ( s x 1 ) f X 1 ( x 1 ) d x 1 = 0 s f X 2 ( s x 1 ) F X 2 ( s x 1 ) F X 2 ( s x 1 ) f X 1 ( x 1 ) 0 + F X 2 ( s x 1 ) f X 1 ( x 1 ) d x 1 d x 1 = 0 s h ˜ X 2 ( s x 1 ) f ( x 1 | s ) d x 1 = E [ h ˜ X 2 ( s X s ) ] ,
where X s is a non-negative rv with a PDF f ( · | s ) provided by
f ( x 1 | s ) = F X 2 ( s x 1 ) f X 1 ( x 1 ) 0 + F X 2 ( s x 1 ) f X 1 ( x 1 ) d x 1 .
Note that E ( X s * ) s . Now, consider an s 0 > 0 such that s 0 < s < τ 1 + τ 2 and for which τ 1 = E ( X s 0 * ) E ( X s * ) . Supposing that X 2 has a decreasing convex reversed hazard rate function, on using Jensen’s inequality, for all s < τ 1 + τ 2 we have
h ˜ X 1 + X 2 ( s ) = E [ h ˜ X 2 ( s X s ) ] , h ˜ X 2 ( s E ( X s ) ) , h ˜ X 2 ( s τ 1 ) .
Now, Theorem 4 is applicable, as the sufficient condition of this theorem is satisfied.
We provide the next example to fulfill the conditions in Theorem 4 in the case of heterogenous exponential components.
Example 5.
Suppose that X 1 and X 2 have an exponential distribution with parameters λ 1 and λ 2 , respectively. It can be checked that the reversed hazard rate function of exponential distribution is decreasing and convex. Thus, h ˜ X 2 ( x ) = λ 2 exp ( λ 2 x ) 1 is a decreasing function in x which is further convex in x. The rv X s , as introduced in Remark 1 with PDF (17), has a PDF
f ( x 1 | s ) = exp ( λ 1 x ) exp ( λ 2 s + ( λ 2 λ 1 ) x ) 1 λ 1 ( 1 exp ( λ 1 s ) ) + 1 λ 2 λ 1 ( exp ( λ 2 s ) exp ( λ 1 s ) ) , 0 x s .
It is straightforward that if X 2 D R H R , then F X 2 ( s x 1 ) is T P 2 in ( x 1 , s ) R + × R + . As a result, from (17), f * ( x 1 | s ) is T P 2 in ( x 1 , s ) R + × R + , that is, X s 1 * l r X s 2 * for every 0 < s 1 s 2 . Because l r implies s t , we can conclude that X s 1 * s t X s 2 * for all 0 < s 1 s 2 . Therefore, E ( X s 1 * ) E ( X s 2 * ) for all s 1 s 2 R + . For example, if λ 1 = 2 and λ 2 = 3 , then after calculation we can obtain
E ( X s ) = exp ( 3 s ) + ( 3 6 s ) exp ( s ) 4 2 exp ( 3 s ) 6 exp ( s ) + 4 ,
which is an increasing function. Hence, if one chooses τ 1 = E ( X 0 * ) = 0 , following the discussion in Remark 1 and noting that for all s > τ 1 we have E ( X s * ) E ( X τ 1 * ) 0 , the assumption in Theorem 4 that h ˜ X 2 ( s τ 1 ) h ˜ X 1 + X 2 ( s ) for all s [ τ 1 , τ 1 + τ 2 ] is fulfilled on this account, and consequently, ( X 1 + X 2 ) ( τ 1 + τ 2 ) s t ( X 1 ) ( τ 1 ) + ( X 2 ) ( τ 2 ) , or more accurately, ( X 1 + X 2 ) ( τ 2 ) s t ( X 2 ) ( τ 2 ) .
Before concluding the paper, we would like to point out that the study conducted in this paper has a number of limitations. For example, the random variables representing the component lifetime in a cold standby system are considered to be independent. In the literature, this condition is usually associated with the problem of convolution of random variables. There is another limitation to the research conducted in this study, namely, that we considered general cold standby systems and not specific ones installed in a particular interconnected system (e.g., systems with parallel or series structures containing redundant standby units). This could represent helpful approach to determine whether the results of the present work are useful for coherent systems as well.

5. Conclusions

In this study, we have presented results for obtaining upper and lower stochastic bounds for the idle time of standby systems after their failure in the context of random lifetimes. These bounds are in fact functions of the idle times of the components of the standby system. In this way, it is possible to evaluate whether it is reasonable to equip a component with redundant standby units in order to minimize the idle time of a standby system. We used two informative and commonly applied stochastic orderings, namely, the likelihood ratio ordering and the usual stochastic ordering. The problem of maintaining systems and replacing them with new systems, along with the similar problem of tuning their components, plays an important role in reliability engineering. This is because there are certain systems, e.g., systems that gradually fail under certain degradation processes, that need to be in operation uniformly, and it is very beneficial for such systems to have less idle time. The results obtained in this work may be useful in identifying situations where the idle time of inactive standby systems and the idle time of components in the system (or a function thereof) have a stochastic ordering property. Because the number of standby units can play a key role in reducing or even increasing costs and preventing further losses due to early component failures, it becomes increasingly important to identify whether a standby system is highly survivable, or equivalently whether it has lower inactivity compared to components that failed earlier.
In future additions to this study, we intend to consider two standby systems with different component lifetimes and possibly different numbers of components, and to investigate stochastic comparisons between the idle time of one system and the sum of the idle times of the components in the other system. We intend to look for the conditions for stochastic comparisons between the idle times of two standby systems. To provide further guidance for future research, the results of this paper can be taken up and, for example, the upper or lower bounds obtained in this paper for the idle time of standby systems can be considered to obtain sharper bounds.

Author Contributions

Methodology, M.S.; Software, M.S.; Validation, M.S.; Formal analysis, M.S.; Investigation, M.K.; Resources, M.S.; Writing—original draft, M.K.; Writing—review and editing, M.K. and M.S.; Visualization, M.K.; Supervision, M.K.; Project administration, M.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Researchers Supporting Project number (RSP2023R464), King Saud University, Riyadh, Saudi Arabia.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The authors thank the three anonymous reviewers for their constructive comments and suggestions. The authors acknowledge financial support from the Researchers Supporting Project number (RSP2023R464), King Saud University, Riyadh, Saudi Arabia.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Levitin, G.; Xing, L.; Dai, Y. Optimal component loading in 1-out-of-N cold standby systems. Reliab. Eng. Syst. Saf. 2014, 127, 58–64. [Google Scholar] [CrossRef]
  2. Fernández, A.J. Optimum attributes component test plans for k-out-of-n: F Weibull systems using prior information. Eur. J. Oper. Res. 2015, 240, 688–696. [Google Scholar] [CrossRef]
  3. Barron, Y.; Yechiali, U. Generalized control-limit preventive repair policies for deteriorating cold and warm standby Markovian systems. Iise Trans. 2017, 49, 1031–1049. [Google Scholar] [CrossRef]
  4. Barron, Y. Group maintenance policies for an R-out-of-N system with phase-type distribution. Ann. Oper. Res. 2018, 261, 79–105. [Google Scholar] [CrossRef]
  5. Levitin, G.; Xing, L.; Dai, Y. Standby mode transfer schedule minimizing downtime of 1-out-of-N system with storage. Reliab. Eng. Syst. Saf. 2023, 237, 109322. [Google Scholar] [CrossRef]
  6. Bian, L.; Wang, G.; Liu, P. Reliability analysis for k-out-of-n (G) systems subject to dependent competing failure processes. Comput. Ind. Eng. 2023, 177, 109084. [Google Scholar] [CrossRef]
  7. Mathur, F.P. On reliability modeling and analysis of ultrareliable fault-tolerant digital systems. IEEE Trans. Comput. 1971, 100, 1376–1382. [Google Scholar] [CrossRef]
  8. Wang, Y. A unified reliability model for fault-tolerant computers. IEEE Trans. Comput. 1980, 100, 1002–1011. [Google Scholar] [CrossRef]
  9. Johnson, B.W.; Julich, P.M. Fault tolerant computer system for the A129 helicopter. IEEE Trans. Aerosp. Electron. Syst. 1985, 21, 220–229. [Google Scholar] [CrossRef]
  10. Sinaki, G. Ultra-reliable fault tolerant inertial reference unit for spacecraft. In Proceeding of the Annual Rocky Mountain Guidance and Control Conference, Keystone, CO, USA, 2–6 February 1994. [Google Scholar]
  11. Pandey, D.; Jacob, M.; Yadav, J. Reliability analysis of a powerloom plant with cold standby for its strategic unit. Microelectron. Reliab. 1996, 36, 115–119. [Google Scholar] [CrossRef]
  12. Coit, D.W. Cold-standby redundancy optimization for nonrepairable systems. Iie Trans. 2001, 33, 471–478. [Google Scholar] [CrossRef]
  13. Hsieh, C.C.; Hsieh, Y.C. Reliability and cost optimization in distributed computing systems. Comput. Oper. Res. 2003, 30, 1103–1119. [Google Scholar] [CrossRef]
  14. Elerath, J.; Pecht, M. A highly accurate method for assessing reliability of redundant arrays of inexpensive disks (RAID). IEEE Trans. Comput. 2008, 58, 289–299. [Google Scholar] [CrossRef]
  15. Wang, Y.; Luo, H.; He, K.; Luo, R.; Yang, H.; Xie, Y. Temperature-aware NBTI modeling and the impact of standby leakage reduction techniques on circuit performance degradation. IEEE Trans. Dependable Secur. Comput. 2010, 8, 756–769. [Google Scholar] [CrossRef]
  16. Wang, J.; Ye, J. A new repair model and its optimization for cold standby system. Oper. Res. 2022, 22, 105–122. [Google Scholar] [CrossRef]
  17. Dobani, E.R.; Juybari, M.N.; Ardakan, M.A. System reliability-redundancy optimization with cold-standby strategy by fitness-distance balance stochastic fractal search algorithm. J. Stat. Comput. Simul. 2022, 92, 2156–2183. [Google Scholar] [CrossRef]
  18. Danjuma, M.U.; Yusuf, B.; Yusuf, I. Reliability, availability, maintainability, and dependability analysis of cold standby series-parallel system. J. Comput. Cogn. Eng. 2022, 1, 193–200. [Google Scholar] [CrossRef]
  19. Malhotra, R.; Alamri, F.S.; Khalifa, H.A.E.W. Novel Analysis between Two-Unit Hot and Cold Standby Redundant Systems with Varied Demand. Symmetry 2023, 15, 1220. [Google Scholar] [CrossRef]
  20. Lin, Z.; Tao, L.; Wang, S.; Chen, C.; Wang, J.; Ge, D. Reliability analysis of cold standby systems using a self-stratifying subset simulation method. J. Stat. Comput. Simul. 2023, 93, 2257–2275. [Google Scholar] [CrossRef]
  21. Bayramoglu, I.; Ozkut, M. Mean residual life and inactivity time of a coherent system subjected to Marshall—Olkin type shocks. J. Comput. Appl. Math. 2016, 298, 190–200. [Google Scholar] [CrossRef]
  22. Zhang, Z.; Balakrishnan, N. Representations of the inactivity time for coherent systems with heterogeneous components and some ordered properties. Metrika 2016, 79, 113–126. [Google Scholar] [CrossRef]
  23. Navarro, J.; Longobardi, M.; Pellerey, F. Comparison results for inactivity times of k-out-of-n and general coherent systems with dependent components. Test 2017, 26, 822–846. [Google Scholar] [CrossRef]
  24. Kayid, M.; Izadkhah, S.; Abouammoh, A.M. Average inactivity time model, associated orderings and reliability properties. Phys. A Stat. Mech. Appl. 2018, 492, 1389–1398. [Google Scholar] [CrossRef]
  25. Navarro, J.; Calì, C. Inactivity times of coherent systems with dependent components under periodical inspections. Appl. Stoch. Model. Bus. Ind. 2019, 35, 871–892. [Google Scholar] [CrossRef]
  26. Salehi, E.; Tavangar, M. Stochastic comparisons on conditional residual lifetime and inactivity time of coherent systems with exchangeable components. Stat. Probab. Lett. 2019, 145, 327–337. [Google Scholar] [CrossRef]
  27. Toomaj, A.; Di Crescenzo, A. Generalized entropies, variance and applications. Entropy 2020, 22, 709. [Google Scholar] [CrossRef]
  28. Amini-Seresht, E.; Kelkinnama, M.; Zhang, Y. On the residual and past lifetimes of coherent systems under random monitoring. Probab. Eng. Inform. Sci. 2021, 35, 465–480. [Google Scholar] [CrossRef]
  29. Guo, Z.; Zhang, J.; Yan, R. On inactivity times of failed components of coherent system under double monitoring. Probab. Eng. Inform. Sci. 2022, 36, 923–940. [Google Scholar] [CrossRef]
  30. Kayid, M.; Shrahili, M. Rényi Entropy for Past Lifetime Distributions with Application in Inactive Coherent Systems. Symmetry 2023, 15, 1310. [Google Scholar] [CrossRef]
  31. Ahmed, H.; Kayid, M. Preservation properties for the Laplace transform ordering of residual lives. Stat. Pap. 2004, 45, 583–590. [Google Scholar] [CrossRef]
  32. Amiripour, F.; Khaledi, B.E.; Shaked, M. Stochastic orderings of convolution residuals. Metrika 2013, 76, 559–576. [Google Scholar] [CrossRef]
  33. Kayid, M.; Alshehri, M.A. Stochastic Comparisons of Lifetimes of Used Standby Systems. Mathematics 2023, 11, 3042. [Google Scholar] [CrossRef]
  34. Ahmad, I.A.; Kayid, M.; Pellerey, F. Further results involving the MIT order and the IMIT class. Probab. Eng. Inform. Sci. 2005, 19, 377–395. [Google Scholar] [CrossRef]
  35. Ortega, E.M. A note on some functional relationships involving the mean inactivity time order. IEEE Trans. Reliab. 2008, 58, 172–178. [Google Scholar] [CrossRef]
  36. Ramsay, C.M. The distribution of sums of certain iid Pareto variates. Commun. Stat.-Theory Methods 2006, 35, 395–405. [Google Scholar] [CrossRef]
  37. Dhaene, J.; Goovaerts, M.J. Dependency of risks and stop-loss order. Astin Bull. J. IAA 1996, 26, 201–212. [Google Scholar] [CrossRef]
  38. Denuit, M.; Genest, C.; Marceau, É. Stochastic bounds on sums of dependent risks. Insur. Math. Econ. 1999, 25, 85–104. [Google Scholar] [CrossRef]
  39. Cai, J.; Li, H. Conditional tail expectations for multivariate phase-type distributions. J. Appl. Probab. 2005, 42, 810–825. [Google Scholar] [CrossRef]
  40. Sordo, M.A.; Suárez-Llorens, A.; Bello, A.J. Comparison of conditional distributions in portfolios of dependent risks. Insur. Math. Econ. 2015, 61, 62–69. [Google Scholar] [CrossRef]
  41. Block, H.W.; Savits, T.H.; Singh, H. The reversed hazard rate function. Probab. Eng. Inform. Sci. 1998, 12, 69–90. [Google Scholar] [CrossRef]
  42. Finkelstein, M.S. On the reversed hazard rate. Reliab. Eng. Syst. Saf. 2002, 78, 71–75. [Google Scholar] [CrossRef]
  43. Kayid, M.; Izadkhah, S. Mean inactivity time function, associated orderings, and classes of life distributions. IEEE Trans. Reliab. 2014, 63, 593–602. [Google Scholar] [CrossRef]
  44. Khan, R.A.; Bhattacharyya, D.; Mitra, M. On some properties of the mean inactivity time function. Stat. Probab. Lett. 2021, 170, 108993. [Google Scholar] [CrossRef]
  45. Shaked, M.; Shanthikumar, J.G. (Eds.) Stochastic Orders; Springer: New York, NY, USA, 2007. [Google Scholar]
  46. Lai, C.D.; Xie, M. Stochastic Ageing and Dependence for Reliability; Springer Science and Business Media: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  47. Karlin, S. Total Positivity; Stanford University Press: Redwood, CA, USA, 1968; Volume 1. [Google Scholar]
  48. Arnold, B.C.; Villasenor, J.A. Exponential characterizations motivated by the structure of order statistics in samples of size two. Stat. Probab. Lett. 2013, 83, 596–601. [Google Scholar] [CrossRef]
Figure 1. Plot of the reliability function of ( X 1 + X 2 ) ( t ) (solid line) and the reliability function of ( X 1 ) ( t ) + ( X 2 ) ( t ) t (dot-dashed line) for t = 1 and x ( 0 , 1 ) .
Figure 1. Plot of the reliability function of ( X 1 + X 2 ) ( t ) (solid line) and the reliability function of ( X 1 ) ( t ) + ( X 2 ) ( t ) t (dot-dashed line) for t = 1 and x ( 0 , 1 ) .
Mathematics 11 04303 g001
Figure 2. Plot of the function R 4 ( w , 2 ) for w ( 0 , 2 ) , with r e + 0 s = r · 10 + s .
Figure 2. Plot of the function R 4 ( w , 2 ) for w ( 0 , 2 ) , with r e + 0 s = r · 10 + s .
Mathematics 11 04303 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Shrahili, M.; Kayid, M. Stochastic Orderings of the Idle Time of Inactive Standby Systems. Mathematics 2023, 11, 4303. https://doi.org/10.3390/math11204303

AMA Style

Shrahili M, Kayid M. Stochastic Orderings of the Idle Time of Inactive Standby Systems. Mathematics. 2023; 11(20):4303. https://doi.org/10.3390/math11204303

Chicago/Turabian Style

Shrahili, Mansour, and Mohamed Kayid. 2023. "Stochastic Orderings of the Idle Time of Inactive Standby Systems" Mathematics 11, no. 20: 4303. https://doi.org/10.3390/math11204303

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop