Bias optimality of admission control in a non-stationary repairable queue

We study a non-stationary repairable queue with a single server and multiple customers’ types. The difference between types of customers is defined by the offered rewards. We show that the bias optimal policy has the trunk reservation (threshold) form. Furthermore, under some given conditions, we also prove that the control level of the bias optimal policy is monotone about time.