Optimality of threshold policies in single-server queueing systems with server vacations
Coauthor(s): Kut So.
In this paper we consider a class of single-server queueing systems with compound Poisson arrivals, in which, at service completion epochs, the server has the option of taking off for one or several vacations of random length. The cost structure consists of holding cost rate specified by a general non-decreasing function of the queue size, fixed costs for initiating and terminating service, and a variable operating cost incurred for each unit of time that the system is in operation. We show under some weak conditions with respect to the holding cost rate function and the service time, vacation time and arrival batch size distributions that it is either optimal along all feasible (stationary and non-stationary) policies never to take a vacation, or it is optimal to take a vacation when the system empties out and to resume work when, upon completion of a vacation, the queue size is equal to or in excess of a critical threshold. These optimality results are generalized for several variants of this model.
Source: Advances in Applied Probability
Federgruen, Awi, and Kut So. "Optimality of threshold policies in single-server queueing systems with server vacations." Advances in Applied Probability 23, no. 2 (June 1991): 388-405.