Hostname: page-component-6766d58669-l4t7p Total loading time: 0 Render date: 2026-05-20T16:59:37.570Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Consecutive-k−Out−of−n Systems under a Fixed Budget

Published online by Cambridge University Press:  27 July 2009

G. J. Chang  and
F. K. Hwang
G. J. Chang
Affiliation:
Department ofMathematics Central University Chungli, Taiwan
F. K. Hwang
Affiliation:
Department of Discrete Mathematics AT&T Bell Laboratories Murray. Hill, New Jersey07974
Get access Rights & Permissions [Opens in a new window]

Abstract

A consecutive-k−out−of−n system is a graph with n vertices where the system fails if and only if some path of k consecutive vertices all fail. The assumption is made that qi, is the failing probability of the ith vertex and the states of the vertices are statistically independent. The problem is to find the best system, i.e., a set {q1, …,qn}, and its assignment to the vertices of the system graph that maximizes the reliability of the system, under the constraint that the product of qi's is a constant. We solve the problem for all lines and some cycles. We then extend our results to trees and show that for given n and k the best tree is a star and the worst is a line.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 2 , Issue 1 , January 1988 , pp. 63 - 73
Copyright
Copyright © Cambridge University Press 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Antonopoulou, I. & Papastavridis, S. (1982). Fast recursive algorithm to evaluate the reliability of a circular consecutive-k−out−of−n system. IEEE Transactions on Reliability R-31: 447–448.Google Scholar
Chiang, D.T. & Chiang, R.F. (1986). Relayed communication via consecutive−k−out−of−n: F system. IEEE Transactions on Reliability R-35: 65–67.CrossRefGoogle Scholar
Chiang, D.T. & Niu, S.C. (1981). Reliability of consecutive-k−out−of−n: F system. IEEE Transactions on Reliability R-30: 87–89.CrossRefGoogle Scholar
Derman, C., Lieberman, G.J. & Ross, S.M. (1982). On the consecutive-k−out−of−n: F system. IEEE Transactions on Reliability R-31: 57–63.CrossRefGoogle Scholar
Du, D.Z. & Hwang, F.K. (1985). Optimal consecutive-2 systems of lines and cycles. Networks 15: 439–447.CrossRefGoogle Scholar
Du, D.Z. & Hwang, F.K. (1986). Optimal consecutive-2-out-of-n systems. Mathematics of Operations Research 11: 187–191.CrossRefGoogle Scholar
Du, D.Z. & Hwang, F.K. (1987). Optimal assignments for consecutive-2 graphs. SIAM Journal of Algebraic and Discrete Methods 8: 510–518.CrossRefGoogle Scholar
Du, D.Z. & Hwang, F.K.Reliabilities of consecutive-2 graphs. Probability in the Engineering and Informational Sciences 1(3): 293–298.CrossRefGoogle Scholar
Hwang, F.K. (1982). Fast solutions for consecutive-k-out-of-n system. IEEE Transactions on Reliability R-31: 447–448.CrossRefGoogle Scholar
Hwang, F.K. (1986). Simplified reliabilities for consecutive-k-out-of-n systems. SIAM Journal of Algebraic Discrete Methods 7: 258–264.CrossRefGoogle Scholar
Kao, S.C. (1982). Computing reliability from warranty. Proceedings of the American Statistical Association, Section on Statist. Comput., 309–312.Google Scholar
Lambiris, M. & Papastavridis, S. (1985). Exact reliability formulas for linear & circular consecutive-k−out−of−n: F systems. IEEE Transactions on Reliability R-34: 124–126.CrossRefGoogle Scholar
Malon, D.M. (1984). Optimal consecutive-2-out-of-n: F component sequencing. IEEE Transactions on Reliability R-33: 414–418.CrossRefGoogle Scholar
Marshall, A.W. & Olkin, I. (1979). Inequalities, theory of majorization and its applications. New York: Academic Press.Google Scholar
Santha, M. & Zhang, Y. (1987). Consecutive-2 systems of trees. Probability in the Engineering and Informational Sciences 1: 441–456.CrossRefGoogle Scholar
Shanthikumar, F.G. (1982). Recursive algorithm to evaluate the reliability of a consecutive- k−out−of−n: F system. IEEE Transactions on Reliability R-31: 442–443.CrossRefGoogle Scholar