An explicit solution for the value function of a priority queue
For an \(N\)-class preemptive-resume priority queue with Poisson arrivals, general class-dependent service time distributions, and holding and switching costs, the authors derive closed-form expressions for the total expected discounted holding and switching costs for any initial state. They calculate the long-run average holding and switching costs and the bias function. This paper generalizes the results of the authors [Queueing Syst. 34, No. 1--4, 199--214 (2000; Zbl 0942.90016)] and \textit{C. Buyukkoc, P. Varaiya} and \textit{J. Walrand} [Adv. Appl. Probab. 17, 237--238 (1985; Zbl 0557.60082)] where the case of two customer classes and exponential service times is treated, for the discounted and the average cost criterion, respectively.
- Explicit solution for M/M/1 preemptive priority queue
- On the value function of a priority queue with an application to a controlled polling model
- Optimal purely functional priority queues
- scientific article; zbMATH DE number 3866341
- A simple implementation technique for priority search queues
- Priority queues
- scientific article; zbMATH DE number 70097
- Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function
- Algorithms and Data Structures
This page was built for publication: An explicit solution for the value function of a priority queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1878851)
