A Bayesian Dynamic Programming approach to optimal maintenance combined with burn-in.

We consider a complex system consisting of N identical components that are expected to function properly during a given period (mission time). Due to the possibility of failure before completion of the mission time, one allows for maintenance as well as bum-in, the latter in order to cope with the problem of ‘infant mortality’. We present a two-level (Bayesian) Dynamic Programming approach to determine the optimal timing of the maintenance interventions and durations of bum-in, including maintenance-induced bum-in. We also discuss ways to reduce the ‘curse of dimensionality’. [ABSTRACT FROM AUTHOR]