Optimality of admission control in a repairable queue

Abstract

We study a repairable M∕M∕1∕N queueing system with multiple types of customers. The difference between customers’ types is defined by the offered rewards. Once customers are admitted to the system, they have the same service rate. We show that under the average reward criterion, all optimal (deterministic) stationary policies have the trunk reservation form. We then prove the uniqueness of the bias optimal policy.