2010
DOI: 10.1243/1748006xjrr332
|View full text |Cite
|
Sign up to set email alerts
|

Review of recent advances in reliability of consecutive k-out-of-n and related systems

Abstract: This paper presents an overview of the research performed on reliability studies of consecutive k-out-of-n and related systems during the last decade. In particular, methods for reliability evaluation, importance and optimal arrangements of components, lifetime distribution, and stochastic orderings of such systems are presented, also research results on related systems are summarized.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
55
0
1

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 67 publications
(57 citation statements)
references
References 71 publications
1
55
0
1
Order By: Relevance
“…For systems with only one type of component, the signature has been derived for some specific system structures [26,27,28,36]. Deriving the survival signature for specific system structures in the case of multiple component types is an interesting topic for research.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…For systems with only one type of component, the signature has been derived for some specific system structures [26,27,28,36]. Deriving the survival signature for specific system structures in the case of multiple component types is an interesting topic for research.…”
Section: Discussionmentioning
confidence: 99%
“…An attractive feature of describing system structures through signatures is the possibility to compare the reliability of different systems based on stochastic ordering of their signatures, as long as the failure times of all components in these systems are exchangeable [33]. A detailed introduction and overview to system signatures is presented by Samaniego [36], some recent advances are reviewed by Eryilmaz [26].…”
Section: Introductionmentioning
confidence: 99%
“…orderings in which the m components can fail must be considered [3,16]. Explicit expressions for the signature of some specific system structures are available [12], but general algorithms to compute signatures have not received much attention in the literature, with the noticeable exception of a logical approach presented by Boland [3] which uses the concept of minimal ordered cut sets, reducing the total number of orderings that need to be counted by grouping together orderings which share the same minimal ordered cut set. However, as any computational method has to deal with the very large number of orderings, it is interesting to consider if one really needs to know the exact signature for a specific inference on the system's reliability.…”
Section: Partially Known Signaturesmentioning
confidence: 99%
“…Subsystem A is the same system, consisting of 7 components (numbered 1-7), as considered in Example 1. Subsystem B consists of 10 components (numbered [8][9][10][11][12][13][14][15][16][17]. While the exact signature for this full system can be obtained by using the given signature for Subsystem A together with repeated use of the algorithm presented by Gaofeng et al [13] for Subsystem B and for the combination of the two subsystems, we assume, in order to illustrate the use of the bounds on signatures presented in this paper, that the signatures of subsystems A and B have only been derived partially, with the bounds and corresponding pessimistic and optimistic signatures as presented in Table 2.…”
Section: Examples Examplementioning
confidence: 99%
“…Recent advancements using the concept of system signature are reported in [4]. However the use of the system signature is associated with the assumption that all components in the system are of the same type.…”
Section: Introductionmentioning
confidence: 99%