Optimal (m-FailureP-Repairmen) policies with random repair time

The failure times of N machines are i.i.d. exponential random variables with parameter lambda. This paper extends the repair model given by [3] to the case where the repair crew is more than one repairmen (P greater than or equal to 1). We developed and implemented an algorithm for finding optimal policies for the new model. The experiments show that bringing more than one repairman is always the optimal solution.