Opportunity-based age replacement: Exponentially distributed times between opportunities
نویسندگان
چکیده
منابع مشابه
Nonparametric adaptive opportunity-based age replacement strategies
We consider opportunity-based age replacement using nonparametric predictive inference (NPI) for the time to failure of a future unit. Based on n observed failure times, NPI provides lower and upper bounds for the survival function for the time to failure Xn+1 of a future unit, which lead to upper and lower cost functions, respectively, for opportunitybased age replacement based on the renewal ...
متن کاملM/G/∞ with exponentially distributed setup times
We consider an M/G/∞ model with exponentially distributed setup times. Arrivals result in an off server starting a setup. Upon completing a setup, a server begins serving a waiting customer. Upon completing service, with probability p the server becomes eligible to serve another waiting customer. Among other things, we show, in steady state, that the number of busy servers is Poisson distribute...
متن کاملOpportunity - based block replacement
In this paper we consider a block replacement model in which a component can be replaced preventively at maintenance opportunities only. Maintenance opportunities occur randomly and are modelled through a renewal process. In the first, theoretical part of the paper we derive an optimality equation and show that the optimal opportunity block replacement policy can be described as a so-called one...
متن کاملStochastic Petri nets with matrix exponentially distributed firing times
There are widely used analysis techniques for stochastic Petri nets with phase type (PH) distributed firing times. These techniques are based on the generation of an expanded Markov chain that describes the behaviour of the marking process and additionally the phase processes of the involved PH distributions. In this paper we investigate the use of a similar approach when the firing time distri...
متن کاملAdjustment of the moments of the project completion times when activity times are exponentially distributed
The problem of determining the moment of the project completion time (MPCT) with stochastic activity durations is addressed. In the direct approach the MPCT is obtained after analyzing all possible network paths which is NP-hard problem. A recursive method for determining MPCT by proceeding iteratively over the nodes is the computationally least demanding and therefore the most efficient approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics
سال: 1992
ISSN: 0894-069X,1520-6750
DOI: 10.1002/1520-6750(199203)39:2<175::aid-nav3220390204>3.0.co;2-y