Optimal Control Of Admission In Service In A Queue With Impatience And Setup Costs

We consider a single server queue in continuous time, in which customers must be served before some limit sojourn time of exponential distribution. Customers who are not served before this limit leave the system: they are impatient. The fact of serving customers and the fact of losing them due to impatience induce costs. The fact of holding them in the queue also induces a constant cost per customer and per unit time. The purpose is to decide whether to serve customers or to keep the server idle, so as to minimize costs. We use a Markov Decision Process with infinite horizon and discounted cost. Since the standard uniformization approach is not applicable here, we introduce a family of approximated uniformizable models, for which we establish the structural properties of the stochastic dynamic programming operator, and we deduce that the optimal policy is of threshold type. The threshold is computed explicitly. We then pass to the limit to show that this threshold policy is also optimal in the original model and we characterize the optimal policy. A particular care is given to the completeness of the proof. We also illustrate the difficulties involved in the proof with numerical examples. (C) 2020 Elsevier B.V. All rights reserved.