On the bias vector of a two-class preemptive priority queue
Robin Groenevelt,
Ger Koole and
Philippe Nain
Mathematical Methods of Operations Research, 2002, vol. 55, issue 1, 107-120
Abstract:
We give a closed-form expression for the long-run average cost and the bias vector in a two-class exponential preemptive resume priority queue with holding and switching costs. The bias vector is the sum of a quadratic function of the number of customers in each priority class and an exponential function of the number of customers in the high priority class. We use this result to perform a single step of the policy iteration algorithm in the model where the switches of the server from one priority class to the other can be controlled. It is numerically shown that the policy resulting from the application of a single step of the policy iteration algorithm is close to the optimal policy. Copyright Springer-Verlag Berlin Heidelberg 2002
Keywords: Key words: priority queues; average cost optimality equation; policy iteration (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://hdl.handle.net/10.1007/s001860200175 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:55:y:2002:i:1:p:107-120
Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186
DOI: 10.1007/s001860200175
Access Statistics for this article
Mathematical Methods of Operations Research is currently edited by Oliver Stein
More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().