Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1
From MaRDI portal
Publication:4785686
DOI10.1137/S0895480100375041zbMATH Open1028.90012WikidataQ60403032 ScholiaQ60403032MaRDI QIDQ4785686FDOQ4785686
Frank K. Hwang, Hung Q. Ngo, X.-H. Jia, Du Ding-Zhu
Publication date: 5 January 2003
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Optimal consecutive-\(k\)-out-of-(\(2k+1\)): \(G\) cycle
- Optimal Consecutive-k-out-of-n:F Component Sequencing
- On Optimal Consecutive k-out-of-n: F Systems Subject to a Fixed Product of Failure Probabilities
- Optimal Consecutive-2-out-of-n:F Component Sequencing
- Optimal Consecutive-2-Out-of-n Systems
Reliability and life testing (62N05) Reliability, availability, maintenance, inspection in operations research (90B25)
Cited In (5)
- Optimal consecutive-\(k\)-out-of-(\(2k+1\)): \(G\) cycle
- Optimal Consecutive-2-Out-of-n Systems
- The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\)
- A note on the proof for the optimal consecutive-\(k\)-out-of-\(n:G\) line for \(n\leqslant 2k\)
- A comment on consecutive-2-out-of-\(n\) systems
This page was built for publication: Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785686)