Non deterministic repairable fault trees for computing optimal repair strategy
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
| Hi-index | 0.00 |
We consider a system with heterogeneous unreliable components that requires only one component to be turned on in order for it to operate. Repair workers may have different skills and may be unavailable for random periods of time. The problem is to determine a usage and repair policy to maximize system availability. We give conditions under which the optimal usage policy is to always use, or turn on, the component with the shortest repair time, and the optimal repair policy is to always repair the most reliable component (with the smallest failure rate). We fully characterize the optimal policy when there are only two components. Our system is equivalent to a closed system with multiple single-server queues, where the objective is to minimize server idle time at one of the queues.