No label defined (Q4945032)

A single-server retrial queue with Poisson arrivals, an infinite-capacity primary queue and an infinite-capacity orbit are considered. If there are \(i\) customers in the primary queue and \(j\) customers in the orbit, a holding cost \(h(i,j)\) per unit time is incurred. The inter-retrial times are assumed to be \(\exp(f(j))\). The problem is to find a routing policy that minimizes the expected discounted cost over an infinite time horizon. By dynamic programming, it is shown that under monotonicity assumptions there is an optimal switching curve in the \((i,j)\) plane. The authors conjecture that this curve is nonincreasing. Finally, they consider the special case of no arrivals and linear \(h\) and \(f\). For the entire collection see [Zbl 0930.00095].