A note on the proof for the optimal consecutive-\(k\)-out-of-\(n:G\) line for \(n\leqslant 2k\) (Q2475782)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the proof for the optimal consecutive-\(k\)-out-of-\(n:G\) line for \(n\leqslant 2k\) |
scientific article |
Statements
A note on the proof for the optimal consecutive-\(k\)-out-of-\(n:G\) line for \(n\leqslant 2k\) (English)
0 references
11 March 2008
0 references
The paper fills a gap in the proof of the optimal placement of different (independent) components in a linear consecutive \(k\)-out-of-\(n\)-system, when \(n\) is strictly less than \(2\, k\).
0 references
consecutive systems
0 references
invariant optimal assignment
0 references
reliability
0 references
\(k\)-out-of-\(n\)-systems
0 references
0 references
0 references
0 references
