Cost analysis of a finite capacity queue with server breakdowns and threshold-based recovery policy

This paper analyzes a repairable M/M/1/N queueing system under a threshold-based recovery policy. The threshold-based recovery policy means that the server breaks down only if there is at least one customer in the system, and the recovery can be performed when q (1 ≤ q ≤ N) or more customers are present. For this queueing system, a recursive method is applied to obtain steady-state solutions in neat closed-form expressions. We then develop some important system characteristics, such as the number of customers in the system, the probability that the server is busy, the effective arrival rate and the expected waiting time in the system, etc. A cost model is constructed to determine the optimal threshold value, the optimal system capacity and the optimal service rate at a minimum cost. In order to solve this optimization problem, the direct search method and Newton's method are employed. Sensitivity analysis is also conducted with various system parameters. Finally, we present some managerial insights through an application example.

► We model a repairable M/M/1/N queueing system under a threshold-based recovery policy.
► A cost model is constructed to determine the optimal threshold value, the optimal system capacity and the optimal service rate.
► We employ the direct search method and Newton's method to optimize the cost function per unit time.
► Sensitivity analysis is conducted.
► We present some managerial insights through an application example.