Optimal maintenance of semi-markov missions

Abstract

We analyze optimal replacement and repair problems of semi-Markov missions that are composed of phases with random sequence and durations. The mission process is the minimal semi-Markov process associated with a Markov renewal process. The system is a complex one consisting of non-identical components whose failure properties depend on the mission process. We prove some monotonicity properties for the optimal replacement policy and analyze the optimal repair problem under different cost structures.