2000 Volume 22 Issue 1 Pages 99-106
The consecutive-k-out-of-n:F system has been studied by many researchers since the beginning in the 1980's. Recently, 2-dimensional-k-within-consecutive-(r, s)-out-of-(m, n):F system has been proposed. This system is a 2-dimensional version of consecutive-k-out-of-n:F system. An efficient method has been studied for the system reliability. Though the method is known to be effective for a small system, the method needs more computation time and more memory capacity, as the size of the system becomes larger. In this paper, we propose upper and lower bounds for the reliabilities of the 2-dimensional-k-within-consecutive-(r, s)-out-of-(m, n):F system. Then, some numerical examples show our proposed upper and lower bounds are more effective than ones which Makri and Psillakis have proposed.
