On the transient behavior of the repairman problem

The paper considers the repairman problem which corresponds to the finite population M/M/1 queue. Asymptotic approximations for the transient probability distribution of the number of broken machines constructed when the number M of machines is large and the service (repair) rate is also large, specifically, O(M). The approximations are constructed by using singular perturbation techniques such as the ray method, boundary layer theory, and the method of matched asymptotic expansions. Extensive numerical comparisons show the quality of the present approximations.