Abstract
Research on analysis of replacement time in standby systems has focused on systems with binary-state standby components. However, when the standby components are multi-state, the replacement time depends on the state of the standby component when it is activated for replacement. This article considers the impacts of state-dependent random replacement times on 1-out-of-N systems consisting of multi-state standby components. Numerical algorithms for evaluating the multi-state standby system’s instantaneous availability, expected availability over system mission time and the expected mission completion time are proposed. A Markov state transition model is used to describe the component behaviour in standby mode. The time-to-failure of the operating component and the replacement time of the standby component can obey arbitrary types of distributions. Illustrative examples are provided to demonstrate the proposed numerical algorithms. The effects of the number of standby components, different replacement time distributions and activation sequences are also discussed.
Keywords
Get full access to this article
View all access options for this article.
