A note on the proof for the optimal consecutive-k-out-of-n:G line for n⩽2k☆
暂无分享,去创建一个
[1] W. Kuo,et al. A consecutive-k-out-of-n:G system: the mirror image of a consecutive-k-out-of-n:F system , 1990 .
[2] Xiaohua Jia,et al. Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1 , 2002, SIAM J. Discret. Math..
[3] F. K. Hwang,et al. Optimal Consecutive-2-Out-of-n Systems , 1986, Math. Oper. Res..
[4] Y. L. Tong,et al. A rearrangement inequality for the longest run, with an application to network reliability , 1985, Journal of Applied Probability.
[5] Way Kuo,et al. Design and performance analysis of consecutive-k-out-of-n structure , 1990 .
[6] Lirong Cui,et al. The optimal consecutive-k-out-of-n:G line for n⩽2k , 2005 .
[7] D. Malon,et al. Optimal Consecutive-2-out-of-n:F Component Sequencing , 1984, IEEE Transactions on Reliability.
[8] Ding-Zhu Du,et al. Optimal Consecutive-k-out-of-(2k+1): G Cycle , 2001, J. Glob. Optim..