Optimal control of admission to a station in a closed two queue system

摘要

We consider a closed queueing system consisting of two stations in tandem. The controller has to make a decision on the number of customers to be admitted for service at the first station so that a long term utility function is maximized. We study the nature of optimal policy for some classes of utility function and transition probability structures. This model can be used to solve many practical closed queueing system problems, like node activation in a rechargeable sensor network. We show that, depending on the number of servers at the various stations, the optimal policy may or may not be greedy.