A heuristic algorithm for determining replacement policies ink-out-of-n systems

DOI10.1002/(SICI)1520-6750(199704)44:3%3C273::AID-NAV3%3E3.0.CO;2-5MaRDI QIDQ4367300zbMATH OpenOpenAlexFDO

Authors Chia-Shin Chung, James Flynn

Publication date 25 November 1997

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199704)44:3%3C273::aid-nav3%3E3.0.co;2-5

zbMATH Keywords

branch-and-bounddiscrete-time, infinite-horizon, dynamic programming

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems
• A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in K-Out-of-N Systems
• Optimal replacement policies for k-out-of-n systems
• A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems
• Optimization issues in \(k\)-out-of-\(n\) systems

Cited in

(4)

• Optimal replacement policy for multicomponent systems: An application to a dairy herd
• A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems
• A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems
• A Branch-and-Bound Algorithm for Computing Optimal Replacement Policies in K-Out-of-N Systems

This page was built for publication: A heuristic algorithm for determining replacement policies ink-out-of-n systems

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