Results 231 to 240 of about 9,750,144 (291)

Computing k-out-of-n System Reliability

IEEE Transactions on Reliability, 1984
A linear-time algorithm and its short computer program in Basic for k- out-of-n: G system reliability computation is presented.
Barlow, R. E., Heidtmann, K. D.
openaire   +1 more source

Optimization issues in k-out-of-n systems

Applied Mathematical Modelling, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shey-Huei Sheu, Tzu-Hsin Liu, Hsin-Nan Tsai, Zhe-George Zhang   +3 more
openaire   +2 more sources

On consecutive-k-out-of-n: F systems

European Journal of Operational Research, 1988
A consecutive k-out-of-n: F system consists of n linearly ordered components. The system fails if and only if at least k consecutive components fail. Here, the system is studied in the general case when the n components are statistically independent and may have different failure probabilities (failure as a function of time is ignored.) Applying the ...
Chan, Fung-Yee, Chan, Lai K., Lin, Gwo Dong   +2 more
openaire   +1 more source

k-out-of-n-system with repair:T-policy

Korean Journal of Computational & Applied Mathematics, 2001
Summary: We consider a \(k\)-out-of-\(n\) system with repair under \(T\)-policy. Life time of each component is exponentially distributed with parameter \(\lambda\). Server is called to the system after the elapse of \(T\) time units since his departure after completion of repair of all failed units in the previous cycle or until accumulation of \(n-k\)
Krishnamoorthy, A., Rekha, A.
openaire   +2 more sources

k-out-of-n sliding window systems

IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2012
This paper proposes a new model that generalizes the linear multistate sliding window system to the case of multiple failures. In this model, the system consists of independent linearly ordered multistate elements. Each element can have different states: from complete failure up to perfect functioning.
G. Levitin, null Yuanshun Dai
openaire   +1 more source

Domination of k-out-of-n systems

IEEE Transactions on Reliability, 1995
The main objective of this paper is to derive a formula for the signed domination of k-out-of-n systems. The behavior of such systems is investigated when pivotal decomposition is applied to them. The nature of the two resulting subsystems has been examined; the signed domination theorem has been extended to those systems and used as a proving tool for
A. Behr, L. Camarinopoulos, G. Pampoukis
openaire   +1 more source

Hazard rate ordering of k-out-of-n systems

Statistics & Probability Letters, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shaked, Moshe, Shanthikumar, J. George
openaire   +2 more sources