This is the most difficult thing I have ever written. Not because I find writing particularly difficult; I have spent nearly 40years making my living as a writer and communicator; but because it means I am finally acknowledging in writing that I have a chronic disease.
Developing effective service policies for multiclass queues with abandonment: asymptotic optimality and approximate policy improvemen James, Terry Informs T. James, K. Glazebrook, K. Lin, "Developing effective service policies for multiclass queues with abandonment: asymptotic optimality and approximate policy improvement," INFORMS Journals on Computing, v.28, no.2 (Spring 2016) e study a single server queuing model with multiple classes and impatient customers. The goal is to determine a service policy to maximize the long-run reward rate earned from serving customers net of holding costs and penalties respectively due to customers waiting for and leaving before receiving service. We first show that it is without loss of generality to study a pure-reward model. Since standard methods can usually only compute the optimal policy for problems with up to three customer classes, our focus is to develop a suite of heuristic approaches, with a preference for operationally simple policies with good reward characteristics. One such heuristic is the Råà rule-a priority policy that ranks all customer classes based on the product of reward R, service rate å, and abandonment rate à. We show that the Råà rule is asymptotically optimal as customer abandonment rates approach zero and often performs well in cases where the simpler Rå rule performs poorly. The paper also develops an approximate policy improvement method that uses simulation and interpolation to estimate the bias function for use in a dynamic programming recursion. For systems with two or three customer classes, our numerical study indicates that the best of our simple priority policies is near optimal in most cases; when it is not, the approximate policy improvement method invariably tightens up the gap substantially. For systems with five customer classes, our heuristics typically achieve within 4% of an upper bound for the optimal value, which is computed via a linear program that relies on a relaxation of the original system. The computational requirement of the approximate policy improvement method grows rapidly when the number of customer classes or the traffic intensity increases.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.