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

DOI<273::AID-NAV3>3.0.CO;2-5 10.1002/(SICI)1520-6750(199704)44:3<273::AID-NAV3>3.0.CO;2-5zbMath0890.90071OpenAlexW2078414364MaRDI QIDQ4367300

James Flynn, Chia-Shin Chung

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199704)44:3<273::aid-nav3>3.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)

Related Items (2)

A branch and bound algorithm for computing optimal replacement policies in consecutivek-out-of-n-systems ⋮ A heuristic algorithm for determining replacement policies in consecutive \(k\)-out-of-\(n\) systems

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