Algorithm for a general discrete k-out-of-n: G system subject to several types of failure with an indefinite number of repairpersons

A discrete k-out-of-n: G system with multi-state components is modelled by means of block-structured Markov chains. An indefinite number of repairpersons are assumed and PH distributions for the lifetime of the units and for the repair time are considered. The units can undergo two types of failures, repairable or non-repairable. The repairability of the failure can depend on the time elapsed up to failure. The system is modelled and the stationary distribution is built by using matrix analytic methods. Several performance measures of interest, such as the conditional probability of failure for the units and for the system, are built into the transient and stationary regimes. Rewards are included in the model. All results are shown in a matrix algorithmic form and are implemented computationally with Matlab. A numerical example of an optimization problem shows the versatility of the model.     

A deteriorating cold standby repairable system with priority in use

In this paper, a cold standby repairable system consisting of two dissimilar components and one repairman is studied. In this system, it is assumed that the working time distributions and the repair time distributions of the two components are both exponential and component 1 is given priority in use. After repair, component 2 is “as good as new” while component 1 follows a geometric process repair. Under these assumptions, using the geometric process and a supplementary variable technique, some important reliability indices such as the system availability, reliability, mean time to first failure (MTTFF), rate of occurrence of failure (ROCOF) and the idle probability of the repairman are derived. A numerical example for the system reliability R(t) is given. And it is considered that a repair-replacement policy based on the working age T of component 1 under which the system is replaced when the working age of component 1 reaches T. Our problem is to determine an optimal policy T^∗ such that the long-run average cost per unit time of the system is minimized. The explicit expression for the long-run average cost per unit time of the system is evaluated, and the corresponding optimal replacement policy T^∗ can be found analytically or numerically. Another numerical example for replacement model is also given.     

Analysis of R out of N systems with several repairmen,exponential life times and phase type repair times: An algorithmic approach

An R out of N repairable system consisting of N independent components is operating if at least R components are functioning. The system fails whenever the number of good components decreases from R to R − 1. A failed component is sent to a repair facility having several repairmen. Life times of working components are i.i.d random variables having an exponential distribution. Repair times are i.i.d random variables having a phase type distribution. Both cold and warm stand-by systems are considered. We present an algorithm deriving recursively in the number of repairmen the generator of the Markov process that governs the process. Then we derive formulas for the point availability, the limiting availability, the distribution of the down time and the up time. Numerical examples are given for various repair time distributions. The numerical examples show that the availability is not very sensitive to the repair time distribution while the mean up time and the mean down time might be very sensitive to the repair time distributions.     

A general model for consecutive-k-out-of-n: F repairable system with exponential distribution and (k−1)-step Markov dependence

In this paper, a general model for consecutive-k-out-of-n: F repairable system with exponential distribution and (k−1)-step Markov dependence is introduced. The lifetime of a component is an exponential random variable, its parameter depends on the number of consecutive failed components that precede the component. The repair time is also an exponential random variable. A priority repair rule on the basis of the system failure risk is adopted. Then the transition density matrix of the system is determined. Some reliability indices, including the system availability, rate of occurrence of failures and reliability are evaluated accordingly. For the demonstration of the model and methodology, a linear system example and a circular system example are investigated.     

Transient analysis of an M/G/1 retrial queue subject to disasters and server failures

An M/G/1 retrial queueing system with disasters and unreliable server is investigated in this paper. Primary customers arrive in the system according to a Poisson process, and they receive service immediately if the server is available upon their arrivals. Otherwise, they will enter a retrial orbit and try their luck after a random time interval. We assume the catastrophes occur following a Poisson stream, and if a catastrophe occurs, all customers in the system are deleted immediately and it also causes the server’s breakdown. Besides, the server has an exponential lifetime in addition to the catastrophe process. Whenever the server breaks down, it is sent for repair immediately. It is assumed that the service time and two kinds of repair time of the server are all arbitrarily distributed. By applying the supplementary variables method, we obtain the Laplace transforms of the transient solutions and also the steady-state solutions for both queueing measures and reliability quantities of interest. Finally, numerical inversion of Laplace transforms is carried out for the blocking probability of the system, and the effects of several system parameters on the blocking probability are illustrated by numerical inversion results.     

A two-unit general parallel system with (n − 2) cold standbys—Analytic and simulation approach

A parallel (2, n − 2)-system is investigated here where two units start their operation simultaneously and any one of them is replaced instantaneously upon its failure by one of the (n − 2) cold standbys. We assume availability of n non-identical, non-repairable units for replacement or support. The system reliability is evaluated by recursive relations with unit-lifetimes T_i (i = 1, … , n) that have a general joint distribution function F(t). On the basis of the derived expression, simulation techniques have been developed for the evaluation of the system reliability and the mean time to failure, useful when dealing with large systems or correlated unit-lifetimes and less mathematically manageable distributions. Simulation results are presented for various lifetime distributions and comparisons are made with derived analytic results for some special distributions and moderate values of n.     

A geometric process maintenance model with preventive repair

In this paper, a geometric process maintenance model with preventive repair is studied. A maintenance policy (T, N) is applied by which the system will be repaired whenever it fails or its operating time reaches T whichever occurs first, and the system will be replaced by a new and identical one following the Nth failure. The long-run average cost per unit time is determined. An optimal policy (T^∗, N^∗) could be determined numerically or analytically for minimizing the average cost. A new class of lifetime distribution which takes into account the effect of preventive repair is studied that is applied to determine the optimal policy (T^∗, N^∗).     

具有位相型修理的离散时间可修排队系统

本文研究了具有一般独立输入，位相型修理的离散时间可修排队系统，假定服务台对顾客的服务时间和服务台寿命服从几何分布，运用矩阵解析方法我们给出系统嵌入在到达时刻的稳态队长分布和等待时间分布，并证明这些分布均为离散位相型分布．我们也得到在广义服务时间内服务台发生故障次数的分布，证明它服从一个修正的几何分布．我们对离散时间可修排队与连续时间可修排队进行了比较，说明这两种排队系统在一些性能指标方面的区别之处．最后我们通过一些数值例子说明在这类系统中顾客的到达过程、服务时间和服务台的故障率之间的关系．     

A δ-shock maintenance model for a deteriorating system

In this paper, a δ-shock maintenance model for a deteriorating system is studied. Assume that shocks arrive according to a renewal process, the interarrival time of shocks has a Weibull distribution or gamma distribution. Whenever an interarrival time of shocks is less than a threshold, the system fails. Assume further the system is deteriorating so that the successive threshold values are geometrically nondecreasing, and the consecutive repair times after failure form an increasing geometric process. A replacement policy N is adopted by which the system will be replaced by an identical new one at the time following the Nth failure. Then the long-run average cost per unit time is evaluated. Afterwards, an optimal policy N^* for minimizing the long-run average cost per unit time could be determined numerically.     

On the equivalence of μ-invariant measures for the minimal process and its q-matrix

In this paper we obtain necessary and sufficient conditions for a measure or vector that is μ-invariant for a q-matrix, Q, to be μ-invariant for the family of transition matrices, {P(t)}, of the minimal process it generates. Sufficient conditions are provided in the case when Q is regular and these are shown not to be necessary. When μ-invariant measures and vectors can be identified, they may be used, in certain cases, to determine quasistationary distributions for the process.     

Phase-type distributions for failure times

Phase-type distributions describe the random time taken for a Markov process to reach an absorbing state. In the context of component failure, sequential movement through the transient states (phases) of such a system could describe the ageing process with movement out of these states (absorption) corresponding to failure. Thus, the lifetime of a component is the absorption time and the probability distribution of these times can be written in terms of the solution of a system of differential equations for which there are many convenient computational algorithms. A variety of different distributions is possible by varying the parameters of the process and hazard rates of various shapes can be constructed, allowing different patterns of variation in observed data to be modelled. These distributions are applied to some industrial data-sets and further features of the processes discussed.     

Comparative analysis for the N policy M/G/1 queueing system with a removable and unreliable server

In this paper we analyze a single removable and unreliable server in the N policy M/G/1 queueing system in which the server breaks down according to a Poisson process and the repair time obeys an arbitrary distribution. The method of maximum entropy is used to develop the approximate steady-state probability distributions of the queue length in the M/G(G)/1 queueing system, where the second and the third symbols denote service time and repair time distributions, respectively. A study of the derived approximate results, compared to the exact results for the M/M(M)/1, M/E₂(E₃)/1, M/H₂(H₃)/1 and M/D(D)/1 queueing systems, suggest that the maximum entropy principle provides a useful method for solving complex queueing systems. Based on the simulation results, we demonstrate that the N policy M/G(G)/1 queueing model is sufficiently robust to the variations of service time and repair time distributions.     

On the first birth and the last death in a generation in a multi-type Markov branching process

In a multi-type continuous time Markov branching process the asymptotic distribution of the first birth in and the last death (extinction) of the kth generation can be determined from the asymptotic behavior of the probability generating function of the vector Z(^k)(t), the size of the kth generation at time t, as t tends to zero or as t tends to infinity, respectively. Apart from an appropriate transformation of the time scale, for a large initial population the generations emerge according to an independent sum of compound multi-dimensional Poisson processes and become extinct like a vector of independent reversed Poisson processes. In the first birth case the results also hold for a multi-type Bellman-Harris process if the life span distributions are differentiable at zero.     

Asymptotic distributions of functions of the eigenvalues of sample covariance matrix and canonical correlation matrix in multivariate time series

Let S = (1/n) Σ_t=1ⁿ X(t) X(t)′, where X(1), …, X(n) are p × 1 random vectors with mean zero. When X(t) (t = 1, …, n) are independently and identically distributed (i.i.d.) as multivariate normal with mean vector 0 and covariance matrix Σ, many authors have investigated the asymptotic expansions for the distributions of various functions of the eigenvalues of S. In this paper, we will extend the above results to the case when {X(t)} is a Gaussian stationary process. Also we shall derive the asymptotic expansions for certain functions of the sample canonical correlations in multivariate time series. Applications of some of the results in signal processing are also discussed.     

Optimal replacement policy based on maximum repair time for a random shock and wear model

We study a \(\delta \) shock and wear model in which the system can fail due to the frequency of the shocks caused by external conditions, or aging and accumulated wear caused by intrinsic factors. The external shocks occur according to a Bernoulli process, i.e., the inter-arrival times between two consecutive shocks follow a geometric distribution. Once the system fails, it can be repaired immediately. If the system is not repairable in a pre-specific time D, it can be replaced by a new one to avoid the unnecessary expanses on repair. On the other hand, the system can also be replaced whenever its number of repairs exceeds N. Given that infinite operating and repair times are not commonly encountered in practical situations, both of these two random variables are supposed to obey general discrete distribution with finite support. Replacing the finite support renewal distributions with appropriate phase-type (PH) distributions and using the closure property associated with PH distribution, we formulate the maximum repair time replacement policy and obtain analytically the long-run average cost rate. Meanwhile, the optimal replacement policy is also numerically determined by implementing a two-dimensional-search process.     

The influence of delivery times on repairable k-out-of-N systems with spares

The k-out-of-N structure is a popular type of redundancy in fault-tolerant systems with wide applications in computer and communication systems, and power transmission and distribution systems, among others, during the past several decades. In this paper, our interest is in such a reliability system with identical, repairable components having exponential life times, in which at least k out of N components are needed for the system to perform its functions. There is a single repairman who attends to failed components on a first-come-first-served basis. The repair times are assumed to be of phase type. The system has K spares which can be tapped to extend the lifetime of the system using a probabilistic rule. We assume that the delivery time of a spare is exponentially distributed and there could be multiple requests for spares at any given time. Our main goal is to study the influence of delivery times on the performance measures of the k-out-of-N reliability system. To that end, the system is analyzed using a finite quasi-birth-and-death process and some interesting results are obtained.     

An LDQBD process under degradation,inspection, and two types of repair

A warm standby n-system with operational and repair times following phase-type distributions is considered. The online unit goes through degradating levels, determined by inspections. Two types of repairs are performed, preventive and corrective, depending on the degradation level. The standby units undergo corrective repair. This systems is governed by a level-dependent-quasi-birth-and-death proces (LDQBD process), whose generator is constructed. The availability, rate of occurrence of failures, and other quantities of interest are calculated. A numerical example including an optimization problem and illustrating the calculations is presented. This system extend other previously studied in the literature.     

Limit theorems for the critical age-dependent branching process with infinite variance

Let Z(t) be the population at time t of a critical age-dependent branching process. Suppose that the offspring distribution has a generating function of the form f(s) = s + (1 ? s)^1+αL(1 ? s) where α ∈ (0, 1) and L(x) varies slowly as x → 0⁺. Then we find, as t → ∞, (P{Z(t)> 0})^αL(P{Z(t)>0})～ μ/αt where μ is the mean lifetime of each particle. Furthermore, if we condition the process on non-extinction at time t, the random variable P{Z(t)>0}Z(t) converges in law to a random variable with Laplace-Stieltjes transform 1 - u(1 + u^α)^?1/α for u ?/ 0. Moment conditions on the lifetime distribution required for the above results are discussed.     

Reliability-based measures for a retrial system with mixed standby components

In this paper, we consider a retrial and repairable multi-component system with mixed warm and cold standby components. It is assumed that the failure times of primary (operating) and warm standby components follow exponential distributions. When a component fails, it is sent to a service station with a single server (repairman) and no waiting space. The failed component is repaired if the server is idle and it has to enter an orbit if the server is busy. The failed component in the orbit will try to get the repair service again after an exponentially distributed random time period. The repair time also has an exponential distribution. The mean time-to-failure, MTTF, and the steady-state availability, A_T(∞), are derived in this retrial and repairable system. Using a numerical example, we compare the systems with and without retrials in terms of the cost/benefit ratios. Sensitivity analysis for the mean time-to-failure and the steady-state availability are investigated as well.     

Variance of the throughput of an N-station production line with no intermediate buffers and time dependent failures

In this study, the variance of the throughput of an N-station production line with no intermediate buffers and time dependent failures is analytically determined. Time to failure and time to repair distributions are assumed to be exponential. The analytical method yields a closed-form expression for the variance of the throughput. The method is based on determining the limiting variance of the total residence (sojourn) time in a specific state of an irreducible recurrent Markov process from the probability of visiting that state at time t given an initial state. This probability function is the instantaneous availability of a production system in the reliability context. A production line with no interstation buffers and time-dependent failures is basically a series system with hot standby. The same procedure can be applied to determine the variance of the throughputs of various arrangements of workstations including series, parallel, series-parallel systems provided that the instantaneous availabilities of these systems can be written explicitly. Numerical experiments show that, although the expected throughput decreases monotonically, the variance of the throughput may increase and then decrease as the number of stations in the line increases depending on the system parameters. Numerical experiments that investigate this phenomenon and also the dependence of the coefficient of variation on the number of stations are also presented in this study.