A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in K-Out-of-N Systems

DOI10.1287/OPRE.43.5.826zbMATH Open0845.90059OpenAlexW1996966020WikidataQ114967769 ScholiaQ114967769MaRDI QIDQ4868802FDOQ4868802

Authors: Chia-Shin Chung, James Flynn 

Publication date: 29 April 1996

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.43.5.826

Recommendations

• A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems
• A heuristic algorithm for determining replacement policies ink-out-of-n systems
• A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems
• Optimal replacement policies for k-out-of-n systems
• Optimal replacement policies for a multicomponent reliability system

zbMATH Keywords

branch-and-bounddiscrete time, infinite-horizon, dynamic programmingreplacement of components

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (5)

• Optimal replacement policies for k-out-of-n systems
• A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems
• Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost
• An enhanced integer simplicial optimization method for minimum cost spares for k-out-of-n systems
• A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems

This page was built for publication: A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in K-Out-of-N Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868802)