Redundant consecutive-k systems

We introduce redundancy into the consecutive-k (-out-of-n) systems which have recently been widely studied. We study three problems: (i) compute the reliabilities for such systems, (ii) assign components with various working probabilities to a given system to maximize its reliability, (iii) select a system under hardware constraints to maximize the reliability.

[1]  Shun-Chen Niu,et al.  Reliability of Consecutive-k-out-of-n:F System , 1981, IEEE Transactions on Reliability.

[2]  S. C. Kao.  Computing reliability from warranty , 1982 .

[3]  Dalen T. Chiang,et al.  Relayed Communication via Consecutive-k-out-of-n: F System , 1986, IEEE Transactions on Reliability.

[4]  F. K. Hwang,et al.  Optimal Consecutive-2-Out-of-n Systems , 1986, Math. Oper. Res..

[5]  Gerald J. Lieberman,et al.  On the Consecutive-k-of-n:F System , 1982, IEEE Transactions on Reliability.

[6]  D. Malon,et al.  Optimal Consecutive-2-out-of-n:F Component Sequencing , 1984, IEEE Transactions on Reliability.

[7]  F. Hwang,et al.  Simplified reliabilities for consecutive- k -out-of- n systems , 1986 .

[8]  Stavros Papastavridis,et al.  Fast Recursive Algorithm to Evaluate the Reliability of a Circular Consecutive-k-out-of-n:F System , 1987, IEEE Transactions on Reliability.

[9]  F. Hwang,et al.  Fast Solutions for Consecutive-k-out-of-n: F System , 1982, IEEE Transactions on Reliability.

[10]  Ding-Zhu Du,et al.  Reliabilities of Consecutive-2 Graphs , 1987 .

[11]  J. George Shanthikumar,et al.  Recursive Algorithm to Evaluate the Reliability of a Consecutive-k-out-of-n:F System , 1982, IEEE Transactions on Reliability.