Abstract
This paper provides reliability analysis of linear strict consecutive-k-out-of-n:F system, introduced and studied by Bollinger in 1985, using Graphical Evaluation and Review Technique (GERT). The components are assumed to be i.i.d. One of the strengths of the GERT network is the graphical representation, which is intuitive and easy to understand. By means of Mason’s rule a simple formula for failure probability is obtained. Mathematica Software is used for systematic computations for different sets of values of n, k and p. Numerical examples illustrate the time efficiency of GERT Analysis.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Agarwal, K. Sen and P. Mohan, “GERT Analysis of m-consecutive-k-out-of-n Systems,” IEEE Trans. Reliability, vol. 56, pp. 26–34, 2007.
Higashiyama, Y., Ohkura, T. and Rumchev, V. (2005), “Time complexity of recursive methods computing the reliability of strict consecutive-k-out-of-n:F systems”, Annual Journal of Engineering, Ehime University, Japan, 3, 65–69.
Kuo, W. and Zuo, M. (2003), Optimal Reliability Modelling - Principles and Applications, John Wiley and Sons, Inc., New Jersey.
Pham, H. (2003), Handbook of Reliability Engineering, Springer-Verlag, London.
Chang, G.J., Cui, L. and Hwang, F.K. (2000), Reliabilities of Consecutive-k Systems, Kluwer Academic Publishers, Netherlands.
Chao, M.T., Fu, J.C. and Koutras, M. V. (1995), “Survey of reliability studies of consecutive-k-out-of-n:F and related systems”, IEEE Transactions on Reliability, 44, 120–127.
Papastavridis, S.G. (1993), “Comment on: Strict consecutive-k-out-of-n:F systems”, IEEE Transactions on Reliability, 42, 171.
Hwang, F.K. (1991), “Comment on: Strict consecutive-k-out-of-n:F systems”, IEEE Transactions on Reliability, 40, 264, 270.
Rushdi, A.M. (1990), “Some open questions on: Strict consecutive-k-out-of-n:F systems, with discussion by: S. G. Papastavridis & R. A. Evans”; IEEE Transactions on Reliability, 39, 380–381.
Kossow, A. and Preuss, W. (1987), “Failure probabilities of strict consecutive-k-out-of-n:F systems”, IEEE Transactions on Reliability, 36, 551–553.
Philippou, A.N. and Makri, F.S. (1987), “Closed formulas for the failure probability of a strict consecutive-k-out-of-n:F system”, IEEE Transactions on Reliability, 36, 80–82.
Papastavridis, S. (1986), “Algorithms for strict consecutive-k-out-of-n:F systems”, IEEE Transactions on Reliability, 35, 613–615.
Fu, J.C. (1985), “Reliability of a large consecutive-k-out-of-n:F system”, IEEE Transactions on Reliability, 34, 127–130.
Lambiris, M. and Papastavridis, S. (1985), “Exact reliability formulas for linear and circular consecutive-k-out-of-n:F systems”, IEEE Transactions on Reliability, 34, 124–126.
Bollinger, R.C. (1985), “Strict consecutive-k-out-of-n:F systems”, IEEE Transactions on Reliability, 34, 50–52.
Feller, W. (1985). An Introduction to Probability Theory and Its Applications, 4th edition, John Wiley & Sons. Inc., New York.
Hwang, F.K. (1982), “Fast solutions for consecutive-k-out-of-n:F system”, IEEE Transactions on Reliability, 31, 447–448.
Chiang, D.T. and Niu, S.C. (1981), “Reliability of consecutive-k-out-of-n:F system”, IEEE Transactions on Reliability, 30, 87–89.
Whitehouse, G. E. (1973), Systems Analysis and Design Using Network Techniques, Prentice-Hall Englewood Cliffs, New Jersey.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mohan, P., Agarwal, M. Strict consecutive-k-out-of-n:F system: GERT analysis. OPSEARCH 44, 337–345 (2007). https://doi.org/10.1007/BF03398798
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398798