一個求連續權重k-out-of-n:F系統可靠度之最佳演算法

Abstract

Reliability evaluation of consecutive-k-out-of-n:F system is widely studied since 1981, and the most efficient algorithm requires O(n) computing time. In this thesis, we propose a more general model and an efficient algorithm to compute the reliability of consecutive-weighted-k-out-of-n:F system in O(n) time. Since the total nember of components is n,our algorithm is optimal. A consecutive-weighted-k-out-of-n:F system consists n components in a linear order, and each component has its own positive integer weight. A consecutive -weighted-k-out-of-n:F system fails if and only if the total weight of consecutive failed components is at least k.