Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems (Q3978839)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 12961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems |
scientific article; zbMATH DE number 12961 |
Statements
Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems (English)
0 references
25 June 1992
0 references
series-parallel systems
0 references
parallel-series system
0 references
reliability
0 references
optimal assignment of components
0 references
totally ordered component allocations
0 references
0.8915364146232605
0 references
0.8550646305084229
0 references
0.8334804773330688
0 references
0.8270597457885742
0 references
The highly combinatorial problem of maximizing the reliability of parallel-series (PS) and series-parallel (SP) systems through the optimal assignment of components is considered. When a position of a PS or SP system receives a shock during the intended period, the component fixed in that position will fail. The reliability of component \(j\) when it is assigned to position \(i\) also depends on the position in which the component is fixed. It is assumed here that this reliability is given by the relation \(p_{ij}=r_ ip_ j\), \(r_ i\) being the probability that position \(i\) is shock-free and \(p_ j\) being the probability that component \(j\) functions throughout the intended period, assuming that these two events are independent. Earlier publications deal with the same problem with the assumption that \(p_{ij}=p_ j\), which is an easier and analytically solvable problem. The definitions of ordered and totally ordered component allocations among the total number of allocations are given. The corresponding theorems are presented which resolve the problem of obtaining the subset of totally ordered component allocations. The search for an optimal solution is restricted to the subset of totally ordered allocations and an algorithm is developed exploiting the nature of Schur-convex functions for obtaining the optimal allocation for the optimal component assignment problem from this subset.
0 references