zbMATH — the first resource for mathematics

Monotonic and insensitive optimal policies for control of queues with undiscounted costs. (English) Zbl 0674.90029
Summary: We consider the problem of controlling the service and/or arrival rates in queues, with the projective of minimizing the total expected cost to reach state zero. We present a unified, simple method for proving that an optimal policy is monotonic in the number of customers in the system. Applications to average-cost minimization over an infinite horizon are given. Both exponential and nonexponential models are considered; the essential characteristic is a left-skip-free transition structure and a nondecreasing (not necessarily convex) holding-cost function. Some of our results are insensitive to service-time distributions.

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
Full Text: DOI Link