Optimization Problems for Consecutive-k-out-of-n:G Systems

Lei ZHOU  Hisashi YAMAMOTO  Taishin NAKAMURA  Xiao XIAO  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E103-A   No.5   pp.741-748
Publication Date: 2020/05/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.2019EAP1126
Type of Manuscript: PAPER
Category: Reliability, Maintainability and Safety Analysis
consecutive-k-out-of-n:G system,  optimization problems,  optimal number of components,  optimal replacement time,  

Full Text: PDF(1.2MB)>>
Buy this Article

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.