Premium
On total capacity of k ‐out‐of‐ n systems with random weights
Author(s) -
Zhang Yiying,
Ding Weiyong,
Zhao Peng
Publication year - 2018
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.21810
Subject(s) - reliability (semiconductor) , order (exchange) , stochastic ordering , mathematical optimization , regular polygon , computer science , multivariate random variable , mathematics , random variable , statistics , power (physics) , physics , geometry , finance , quantum mechanics , economics
In engineering applications, many reliability systems can be modeled as k ‐out‐of‐ n systems with components having random weights. Before putting such kind of system into a working state, it is of great significance for a system designer to find out the optimal assembly of the random weights to the components. In this article, we investigate the performance levels of k ‐out‐of‐ n systems with random weights. Optimal assembly policies are obtained by maximizing the total capacity according to different criteria, including the usual stochastic order, the increasing convex [concave] order, and the expectation order. Based on the optimal assembly strategy derived by maximizing the expected total capacity, we further investigate stochastic properties of the resulting weighted system with respect to the vector of expectations of random weights. Numerical examples are provided to highlight our theoretical findings as well.