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.     

An optimal replacement policy for a multistate degenerative simple system

In this paper, a degenerative simple system (i.e. a degenerative one-component system with one repairman) with k + 1 states, including k failure states and one working state, is studied. Assume that the system after repair is not “as good as new”, and the degeneration of the system is stochastic. Under these assumptions, we consider a new replacement policy T based on the system age. Our problem is to determine an optimal replacement policy T^∗ such that the average cost rate (i.e. the long-run average cost per unit time) of the system is minimized. The explicit expression of the average cost rate is derived, the corresponding optimal replacement policy can be determined, the explicit expression of the minimum of the average cost rate can be found and under some mild conditions the existence and uniqueness of the optimal policy T^∗ can be proved, too. Further, we can show that the repair model for the multistate system in this paper forms a general monotone process repair model which includes the geometric process repair model as a special case. We can also show that the repair model in the paper is equivalent to a geometric process repair model for a two-state degenerative simple system in the sense that they have the same average cost rate and the same optimal policy. Finally, a numerical example is given to illustrate the theoretical results of this model.     

A bivariate mixed policy for a simple repairable system based on preventive repair and failure repair

In this paper, a simple repairable system (i.e. a one-component repairable system with one repairman) with preventive repair and failure repair is studied. Assume that the preventive repair is adopted before the system fails, when the system reliability drops to an undetermined constant R  , the work will be interrupted and the preventive repair is executed at once. And assume that the preventive repair of the system is “as good as new” while the failure repair of the system is not, and the deterioration of the system is stochastic. Under these assumptions, by using geometric process, we present a bivariate mixed policy (R,N)$(R\text{,}N)$, respectively based on a scale of the system reliability and the failure-number of the system. Our aim is to determine an optimal mixed policy (R,N)^∗$(R\text{,}N{)}^{\ast }$ such that the long-run average cost per unit time (i.e. the average cost rate) is minimized. The explicit expression of the average cost rate is derived, and the corresponding optimal mixed policy can be determined analytically or numerically. Finally, a numerical example is given where the working time of the system yields a Weibull distribution. Some comparisons with a certain existing policy are also discussed by numerical methods.     

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^∗).     

An extended replacement policy for a deteriorating system with multi-failure modes

In this paper, the maintenance problem for a deteriorating system with k + 1 failure modes, including an unrepairable failure (catastrophic failure) mode and k repairable failure (non-catastrophic failure) modes, is studied. Assume that the system after repair is not “as good as new” and its deterioration is stochastic. Under these assumptions, an extended replacement policy N is considered: the system will be replaced whenever the number of repairable failures reaches N or the unrepairable failure occurs, whichever occurs first. Our purpose is to determine an optimal extended policy N^∗ such that the average cost rate (i.e. the long-run average cost per unit time) of the system is minimized. The explicit expression of the average cost rate is derived, and the corresponding optimal extended policy N^∗ can be determined analytically or numerically. Finally, a numerical example is given to illustrate some theoretical results of the repair model proposed in this paper.     

Optimal repair–replacement policies for a system with two types of failures

In this paper, the optimal replacement problem is investigated for a system with two types of failures. One type of failure is repairable, which is conducted by a repairman when it occurs, and the other is unrepairable, which leads to a replacement of the system at once. The repair of the system is not “as good as new”. The consecutive operating times of the system after repair form a decreasing geometric process, while the repair times after failure are assumed to be independent and identically distributed. Replacement policy N is adopted, where N is the number of repairable failures. The system will be replaced at the Nth repairable failure or at the unrepairable failure, whichever occurs first. Two replacement models are considered, one is based on the limiting availability and the other based on the long-run average cost rate of the system. We give the explicit expressions for the limiting availability and the long-run average cost rate of the system under policy N, respectively. By maximizing the limiting availability A(N) and minimizing the long-run average cost rate C(N), we theoretically obtain the optimal replacement policies N^∗ in both cases. Finally, some numerical simulations are presented to verify the theoretical results.     

A deteriorating system with its repairman having multiple vacations

This paper considers a repairable system with a repairman, who can take multiple vacations. If the system fails and the repairman is on vacation, it will wait for repair until the repairman is available. Assume that the system cannot be repaired “as good as new” after failures. Under these assumptions, using the geometric process and the supplementary variable technique, some important reliability indexes are derived, such as the system reliability, availability, rate of occurrence of failures, etc. According to the renewal reward theorem, the explicit expression of the expected profit per unit time is obtained. Finally, a numerical example is given to illustrate that there exists an optimal replacement policy N∗, which maximizes the value of the expected profit rate after a long time run.     

基于基准可靠度和预防维修次数上限的两参数预防维修策略

本文研究了一类修旧非新的两参数预防维修策略.在预防维修依赖于基准可靠度R的条件下,利用系统的相关可靠性指标建立了平均费用关于R和N(预防维修次数上限)的函数关系.进一步找到了该函数的最小值点,即得到了最优策略(R,N)*.同时通过实例说明了本文的维修策略优于文献[8].     

Modelling of a deteriorating system with repair satisfying general distribution

In this paper, we model a deteriorating system that cannot be repaired “as good as new” after failures, the model comes from [19, Applied Mathematics and Computation, 217(2011), 4980-4989]. Suppose that the system has one repairman who can have multiple vacations, and if the system fails when the repairman is on vacation, it will wait for repair until the repairman is available. Herein the repair time is taken into account and supposes that the repair satisfies the general distribution. Under these assumptions, by means of the geometric process and the supplementary variable techniques, we derive a complete model of the partial differential equations, which will correct an error of mathematical model in [19]. Moreover, we deduce some important reliability indices of the system such as the availability of system, the probability of the repairman working and the rate of occurrence of failures. In particular, we prove that the rate of occurrence of failures m_f is not equal to zero.     

An optimal repair–replacement policy for a cold standby system with use priority

In this paper, the maintenance problem for a cold standby system consisting of two dissimilar components and one repairman is studied. Assume that both component 1 and component 2 after repair follow geometric process repair and component 1 is given priority in use when both components are workable. Under these assumptions, using geometric process repair model, we consider a replacement policy N under which the system is replaced when the number of failures of component 1 reaches N. Our purpose is to determine an optimal replacement policy N1 such that the average cost rate (i.e. the long-run average cost per unit time) of the system is minimized. The explicit expression for the average cost rate of the system is derived and the corresponding optimal replacement policy N1 can be determined analytically or numerically. Finally, a numerical example is given to illustrate some theoretical results and the model applicability.     

Reliability analysis of a k-out-of-n:G repairable system with single vacation

This paper analyzes a k-out-of-n:G   repairable system with one repairman who takes a single vacation, the duration of which follows a general distribution. The working time of each component is an exponentially distributed random variable and the repair time of each failed component is governed by an arbitrary distribution. Moreover, we assume that every component is “as good as new” after being repaired. Under these assumptions, several important reliability measures such as the availability, the rate of occurrence of failures, and the mean time to first failure of the system are derived by employing the supplementary variable technique and the Laplace transform. Meanwhile, their recursive expressions are obtained. Furthermore, through numerical examples, we study the influence of various parameters on the system reliability measures. Finally, the Monte Carlo simulation and two special cases of the system which are (n-1)$(n-1)$-out-of-n:G repairable system and 1-out-of-n:G repairable system are presented to illustrate the correctness of the analytical results.     

有延迟修理的两部件串联系统的预防维修策略

研究由两个部件串联组成的系统的预防维修策略, 当系统的工作时间达到T时进行预防维修, 预防维修使部件恢复到上一次故障维修后的状态. 当部件发生故障后进行故障维修, 因为各种原因可能会延迟修理. 部件在每次故障维修后的工作时间形成随机递减的几何过程, 且每次故障后的维修时间形成随机递增的几何过程. 以部件进行预防维修的间隔T和更换前的故障次数N组成的二维策略(T,N)为策略, 利用更新过程和几何过程理论求出了系统经长期运行单位时间内期望费用的表达式, 并给出了具体例子和数值分析.     

Optimal production correction and maintenance policy for imperfect process

This study considers imperfect production processes that require production correction and maintenance. Two states of the production process are performed, namely: the type I state (out-of-control state) and the type II state (in-control state). At the beginning of the production of the each renewal cycle, the state of the process is assumed not always to be restored to “in-control”. The type I state involves the adjustment of the production mechanism, whereas the type II state does not. Production correction is either imperfect; worsening a production system, or perfect, returning it to “in-control”. After N + 1 type I states, the operating system must be maintained and returned to the beginning condition. The mean loss cost due to reproduction through production correction per the total expected cost until the N + 1 type I states are entered successively is determined. The existence of a unique and finite optimal N for an imperfect process under certain reasonable conditions is shown. A numerical example is presented.     

有两种故障状态的两部件串联系统的预防维修策略

本文研究的是由两个部件串联组成且有两种故障状态的系统的预防维修策略, 当系统的工作时间达到T时进行预防维修, 预防维修使部件恢复到上一次故障维修后的状态。每个部件发生故障都有两种状态, 可维修和不可维修。当部件的故障为可维修故障时, 修理工对其进行故障维修, 且每次故障维修后的工作时间形成随机递减的几何过程, 每次故障后的维修时间形成随机递增的几何过程。当部件发生N次可维修故障或一次不可维修故障时进行更换。以部件进行预防维修的间隔和更换前的可维修故障次数N组成的二维策略(T, N) 为策略, 利用更新过程和几何过程理论求出了系统经长期运行单位时间内期望费用的表达式, 并给出了具体例子和数值分析。     

Optimal replacement policies with minimal repair and age-dependent costs

In this paper, we study a modified minimal repair/replacement problem that is formulated as a Markov decision process. The operating cost is assumed to be a nondecreasing function of the system's age. The specific maintenance actions for a manufacturing system to be considered are whether to have replacement, minimal repair or keep it operating. It is shown that a control limit policy, or in particular a (t, T) policy, is optimal over the space of all possible policies under the discounted cost criterion. A computational algorithm for the optimal (t, T) policy is suggested based on the total expected discounted cost.     

The complete optimal stars-clustering-tree problem

We consider the following complete optimal stars-clustering-tree problem: Given a complete graph G=(V,E) with a weight on every edge and a collection of subsets of V, we want to find a minimum weight spanning tree T such that each subset of the vertices in the collection induces a complete star in T. One motivation for this problem is to construct a minimum cost (weight) communication tree network for a collection of (not necessarily disjoint) groups of customers such that each group induces a complete star. As a result the network will provide a “group broadcast” property, “group fault tolerance” and “group privacy”. We present another motivation from database systems with replications. For the case where the intersection graph of the subsets is connected we present a structure theorem that describes all feasible solutions. Based on it we provide a polynomial algorithm for finding an optimal solution. For the case where each subset induces a complete star minus at most k leaves we prove that the problem is NP-hard.     

Topological characterisation of weakly compact operators

Let X be a Banach space. Then there is a locally convex topology for X, the “Right topology,” such that a linear map T, from X into a Banach space Y, is weakly compact, precisely when T is a continuous map from X, equipped with the “Right” topology, into Y equipped with the norm topology. When T is only sequentially continuous with respect to the Right topology, it is said to be pseudo weakly compact. This notion is related to Pelczynski's Property (V).     

Average optimality for continuous-time Markov decision processes with a policy iteration approach

This paper deals with the average expected reward criterion for continuous-time Markov decision processes in general state and action spaces. The transition rates of underlying continuous-time jump Markov processes are allowed to be unbounded, and the reward rates may have neither upper nor lower bounds. We give conditions on the system's primitive data and under which we prove the existence of the average reward optimality equation and an average optimal stationary policy. Also, under our conditions we ensure the existence of ?-average optimal stationary policies. Moreover, we study some properties of average optimal stationary policies. We not only establish another average optimality equation on an average optimal stationary policy, but also present an interesting “martingale characterization” of such a policy. The approach provided in this paper is based on the policy iteration algorithm. It should be noted that our way is rather different from both the usually “vanishing discounting factor approach” and the “optimality inequality approach” widely used in the previous literature.     

Continued fractions and Dedekind sums: Three-term relations and distribution

Let 0?m<N be coprime integers and T(m,N) the sum of the digits of the continued fraction expansion of m/N. We study the distribution of large values of T(m,N) (“large” means T(m,N)?Nα for some fixed exponent α when N tends to infinity), which seems to be quite similar to that of the absolute values of the corresponding Dedekind sums S(m,N). This similarity is (partially, at least) due to analogous three-term relations holding for both kinds of sums. We show, e.g.,