Selective Maintenance Optimization Problem In Systems Under Repairpersons Availability

Industrial systems are sometimes designed to operate their missions with finite breaks scheduled between two consecutive missions. During the break, maintenance actions can be carried out. Given the limited break duration, in addition to other limited maintenance resources, not all components can be maintained. To meet the required performance of the system during the next mission, it is often required to select components to be maintained. This decision making problem is known as the selective maintenance problem (SMP). In the literature, the existing SM models merely rely on the assumption that repair channels are always available to perform their maintenance duties. The present paper introduces a novel and more realistic formulation of the SMP where the unavailability of the repair channels is accounted for. Two integrated non-linear programming models are developed and solved, without loss of generality, in a series-parallel system under multiple repair channels. The results derived allow to show the validity and the accuracy of the proposed approach.