A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1

2002
*
SIAM Journal on Discrete Mathematics
*

A cyclic consecutive-k-out-of-n: G system consists of n components lying on a cycle. Those components are exchangeable but may have different working probabilities. The system works if and only if there are k consecutive components at work. What is the optimal assignment of components for maximizing the reliability of the system? Does the optimal assignment depend on the working probability values of components? For k ≤ n ≤ 2k + 1, Zuo and Kuo in 1990 proposed a solution independent from the

doi:10.1137/s0895480100375041
fatcat:7tdxd6pabbbc5inx7cgbatk3wq