Abstract
We present a complete proof for the invariant optimal assignment for consecutive-k-out-of-(2k+1): G cycle, which was proposed by Zuo and Kao in 1990 with an incomplete proof, pointed out recently by Jalali, Hawkes, Cui and Hwang.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Jalali, A., Hawkes, A.G., Cui, L. and Hwang, F.K. The optimal consecutive-k-out-of-n: G line for n ⩽ 2k, to appear in Naval Res. Logist.
Kuo, W., Zhang, W. and Zuo, M. (1990), A consecutive-k-out-of-n: G system: The mirror image of a consecutive-k-out-of-n: F system, IEEE Trans. Rel. 39: 244-253.
Zuo, M. and Kuo, W. (1990), Design and performance analysis of consecutive-k-out-of-n: structure, Naval Res. Logist. 37: (1990), 203-230.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Du, DZ., Hwang, F.K., Jung, Y. et al. Optimal Consecutive-k-out-of-(2k+1): G Cycle. Journal of Global Optimization 19, 51–60 (2001). https://doi.org/10.1023/A:1008308211943
Issue Date:
DOI: https://doi.org/10.1023/A:1008308211943