A rearrangement inequality for the longest run, with an application to network reliability

DOI10.2307/3213781zbMath0564.60085OpenAlexW2320173905MaRDI QIDQ3678429

Y. L. Tong

Publication date: 1985

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213781

zbMATH Keywords

rearrangement inequalityoptimal permutation problem

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Related Items (14)

Reliability evaluation of multi-state consecutive \(k\)-out-of-\(r\)-from-\(n:G\) system ⋮ Combined \(m\)-consecutive and \(k\)-out-of-\(n\) sliding window systems ⋮ Importance measures in reliability and mathematical programming ⋮ On a generalizedk-out-of-nsystem and its reliability ⋮ The reliability of exchangeable binary systems ⋮ A note on the proof for the optimal consecutive-\(k\)-out-of-\(n:G\) line for \(n\leqslant 2k\) ⋮ A general model for consecutive-\(k\)-out-of-\(n:F\) repairable system with exponential distribution and \((k-1)\)-step Markov dependence. ⋮ The optimal consecutive-\(k\)-out-of-\(n\):\(G\) line for \(n \leqslant 2k\) ⋮ Bounds for increasing multi-state consecutive \(k\)-out-of-\(r\)-from-\(n\): \(F\) system with equal components probabilities ⋮ Uneven allocation of elements in linear multi-state sliding window system ⋮ A limit theorem of certain repairable systems ⋮ Mean Residual Lifetimes of Consecutive-k-out-of-n Systems ⋮ Discrete Scan Statistics Generated by Exchangeable Binary Trials ⋮ Linear Dependence in Consecutive k-out-of-n: F Systems

This page was built for publication: A rearrangement inequality for the longest run, with an application to network reliability