A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems
From MaRDI portal
Publication:4533475
DOI10.1002/nav.10017zbMath1006.90024WikidataQ115150511 ScholiaQ115150511MaRDI QIDQ4533475
Publication date: 11 June 2002
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10017
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B25: Reliability, availability, maintenance, inspection in operations research
Related Items
A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems
Cites Work
- Unnamed Item
- Optimal replacement policies for a multicomponent reliability system
- Economical Design of Large Consecutive-k-out-of-n:F Systems
- Optimal maintenance models for systems subject to failure–A Review
- Reliability of Consecutive-k-out-of-n:F System
- Fast Solutions for Consecutive-k-out-of-n: F System
- A survey of maintenance models: The control and surveillance of deteriorating systems
- Optimum Allocation of Components in a Special 2-Port Network
- A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in K-Out-of-N Systems