Optimal admission control for M/D/1/K queueing systems

Abstract.

For a single server loss system with finite waiting room with Poisson arrivals and deterministic service times we compute the optimal admission control rule when additionally to the queue length the residual service time is considered as a decision variable. The reward function is of a rather general form. The optimal policy for maximizing the average reward per time unit is of threshold structure. Some of the results are generalized to the case of renewal arrivals.