Admission control for a multi-server queue with abandonment (Q5962129)

The following problem is considered: In a \(M/M/N+M\) queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. On the other hand, rejecting new arrivals increases the percentage of time servers are idle, which also may not be desirable. The authors address these trade-offs by considering an admission control problem for a \(M/M/N+M\) queue when there are costs associated with customer abandonment, server idleness, and turning away customers. First, they formulate the relevant Markov decision process (MDP), show that the optimal policy is of threshold form, and provide a simple and efficient iterative algorithm that does not presuppose a bounded state space to compute the minimum infinite horizon expected average cost and associated threshold level. Under certain conditions they can guarantee that the algorithm provides an exact optimal solution when it stops; otherwise, the algorithm stops when a provided bound on the optimality gap is reached. Next, they solve the approximating diffusion control problem (DCP) that arises in the Halfin-Whitt many-server limit regime. This allows them to establish that the parameter space has a sharp division. Specifically, there is an optimal solution with a finite threshold level when the cost of an abandonment exceeds the cost of rejecting a customer; otherwise, there is an optimal solution that exercises no control. This analysis also yields a convenient analytic expression for the infinite horizon expected average cost as a function of the threshold level. Finally, they propose a policy for the original system that is based on the DCP solution, and show that this policy is asymptotically optimal. Their extensive numerical study shows that the control that arises from solving the DCP achieves a very similar cost to the control that arises from solving the MDP, even when the number of servers is small.