A branch and bound algorithm for computing optimal replacement policies in consecutive k-out-of-n-systems

A heuristic algorithm for determining re

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

✍ Chia-Shin Chung; James Flynn 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB 👁 1 views

The authors study a discrete-time, infinite-horizon, dynamic programming model for the replacement of components in a binary k-out-of-n failure system. (The system fails when k or more of its n components fail.) Costs are incurred when the system fails and when failed components are replaced. The ob