The optimal consecutive-k-out-of-n:G line for n≤2k

被引:16
作者
Jalali, A
Hawkes, AG [1 ]
Cui, LR
Hwang, FK
机构
[1] Univ Wales Swansea, European Business Management Sch, Swansea SA2 8PP, W Glam, Wales
[2] Beijing Inst Technol, Sch Management & Econom, Beijing 100081, Peoples R China
[3] Natl Chiao Tung Univ, Dept Appl Math, Hsinchu, Taiwan
关键词
reliability; consecutive systems; optimal assignment;
D O I
10.1016/j.jspi.2003.09.018
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Two proofs for the problem in the title have been published but both are incomplete. In this note we observe the subtle errors in these proofs and give a new proof by a different approach. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:281 / 287
页数:7
相关论文
共 4 条
[1]   A CONSECUTIVE-K-OUT-OF-N - G-SYSTEM - THE MIRROR-IMAGE OF A CONSECUTIVE-K-OUT-OF-N - F-SYSTEM [J].
KUO, W ;
ZHANG, WX ;
ZUO, MJ .
IEEE TRANSACTIONS ON RELIABILITY, 1990, 39 (02) :244-253
[2]   A REARRANGEMENT INEQUALITY FOR THE LONGEST RUN, WITH AN APPLICATION TO NETWORK RELIABILITY [J].
TONG, YL .
JOURNAL OF APPLIED PROBABILITY, 1985, 22 (02) :386-393
[3]  
ZUO MJ, 1990, NAV RES LOG, V37, P203, DOI 10.1002/1520-6750(199004)37:2<203::AID-NAV3220370203>3.0.CO
[4]  
2-X