The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\)
From MaRDI portal
Publication:1765774
DOI10.1016/J.JSPI.2003.09.018zbMath1140.90365OpenAlexW1996894622MaRDI QIDQ1765774
A. Jalali, Lirong Cui, A. G. Hawkes, Frank K. Hwang
Publication date: 23 February 2005
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2003.09.018
Reliability, availability, maintenance, inspection in operations research (90B25) Discrete location and assignment (90B80)
Related Items (4)
Circular consecutive \(k\)-out-of-\(n\) systems with exchangeable dependent components ⋮ Measuring component importance for network system using cellular automata ⋮ A note on the proof for the optimal consecutive-\(k\)-out-of-\(n:G\) line for \(n\leqslant 2k\) ⋮ Consecutivek-Out-of-n:GSystem in Stress-Strength Setup
Cites Work
This page was built for publication: The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\)