A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems
DOI10.1002/NAV.10017zbMATH Open1006.90024OpenAlexW2146604050WikidataQ115150511 ScholiaQ115150511MaRDI QIDQ4533475FDOQ4533475
Authors: James Flynn, Chia-Shin Chung 
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
Recommendations
- A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in K-Out-of-N Systems
- A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems
- A heuristic algorithm for determining replacement policies ink-out-of-n systems
- Optimal replacement policies for k-out-of-n systems
- Optimization problems for consecutive-2-out-of-\(n\):G system
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Reliability, availability, maintenance, inspection in operations research (90B25)
Cites Work
- A survey of maintenance models: The control and surveillance of deteriorating 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
- Economical Design of Large Consecutive-k-out-of-n:F Systems
- Optimal replacement policies for a multicomponent reliability system
- Optimum Allocation of Components in a Special 2-Port Network
- A heuristic algorithm for determining replacement policies ink-out-of-n systems
- A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in K-Out-of-N Systems
Cited In (3)
This page was built for publication: A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4533475)
