A consecutive-k-out-of-n:G system consists of n components which are arranged in a line and the system works if and only if at least k consecutive components work. This paper discusses the optimization problems for a consecutive-k-out-of-n:G system. We first focus on the optimal number of components at the system design phase. Then, we focus on the optimal replacement time at the system operation phase by considering a preventive replacement, which the system is replaced at the planned time or the time of system failure which occurs first. The expected cost rates of two optimization problems are considered as objective functions to be minimized. Finally, we give study cases for the proposed optimization problems and evaluate the feasibility of the policies.
Lei ZHOU
Tokyo Metropolitan University
Hisashi YAMAMOTO
Tokyo Metropolitan University
Taishin NAKAMURA
Tokyo Metropolitan University
Xiao XIAO
Tokyo Metropolitan University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Lei ZHOU, Hisashi YAMAMOTO, Taishin NAKAMURA, Xiao XIAO, "Optimization Problems for Consecutive-k-out-of-n:G Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 5, pp. 741-748, May 2020, doi: 10.1587/transfun.2019EAP1126.
Abstract: A consecutive-k-out-of-n:G system consists of n components which are arranged in a line and the system works if and only if at least k consecutive components work. This paper discusses the optimization problems for a consecutive-k-out-of-n:G system. We first focus on the optimal number of components at the system design phase. Then, we focus on the optimal replacement time at the system operation phase by considering a preventive replacement, which the system is replaced at the planned time or the time of system failure which occurs first. The expected cost rates of two optimization problems are considered as objective functions to be minimized. Finally, we give study cases for the proposed optimization problems and evaluate the feasibility of the policies.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019EAP1126/_p
Copy
@ARTICLE{e103-a_5_741,
author={Lei ZHOU, Hisashi YAMAMOTO, Taishin NAKAMURA, Xiao XIAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Optimization Problems for Consecutive-k-out-of-n:G Systems},
year={2020},
volume={E103-A},
number={5},
pages={741-748},
abstract={A consecutive-k-out-of-n:G system consists of n components which are arranged in a line and the system works if and only if at least k consecutive components work. This paper discusses the optimization problems for a consecutive-k-out-of-n:G system. We first focus on the optimal number of components at the system design phase. Then, we focus on the optimal replacement time at the system operation phase by considering a preventive replacement, which the system is replaced at the planned time or the time of system failure which occurs first. The expected cost rates of two optimization problems are considered as objective functions to be minimized. Finally, we give study cases for the proposed optimization problems and evaluate the feasibility of the policies.},
keywords={},
doi={10.1587/transfun.2019EAP1126},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Optimization Problems for Consecutive-k-out-of-n:G Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 741
EP - 748
AU - Lei ZHOU
AU - Hisashi YAMAMOTO
AU - Taishin NAKAMURA
AU - Xiao XIAO
PY - 2020
DO - 10.1587/transfun.2019EAP1126
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2020
AB - A consecutive-k-out-of-n:G system consists of n components which are arranged in a line and the system works if and only if at least k consecutive components work. This paper discusses the optimization problems for a consecutive-k-out-of-n:G system. We first focus on the optimal number of components at the system design phase. Then, we focus on the optimal replacement time at the system operation phase by considering a preventive replacement, which the system is replaced at the planned time or the time of system failure which occurs first. The expected cost rates of two optimization problems are considered as objective functions to be minimized. Finally, we give study cases for the proposed optimization problems and evaluate the feasibility of the policies.
ER -