A Dynamic Priority Queue with General Concave Priority Functions

A. Netterman and I. Adiri
Additional contact information
A. Netterman: Israel Institute of Technology, Haifa, Israel
I. Adiri: Israel Institute of Technology, Haifa, Israel

Operations Research, 1979, vol. 27, issue 6, 1088-1100

Abstract: This paper analyzes mathematically a queueing model where a single server dispenses service to several, m , non-preemptive priority classes. It is assumed that the arrival process of customers who belong to the k class ( k customers) is Poisson, and their service times are independent, identical, arbitrarily distributed random variables. The priority degree of a customer at a certain moment is not only a function of his class, but is also a general concave function of the time he has already spent in the system. (The discipline is termed “dynamic-priority.”) Upon departure the server selects for service, from the customers present, the one with the highest instantaneous priority degree, breaking ties by the FIFO rule. An implicit function as well as upper and lower bounds on the expected waiting time of k customer are found. The effectiveness of the bounds is demonstrated by a numerical example.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.6.1088 (application/pdf)

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:inm:oropre:v:27:y:1979:i:6:p:1088-1100

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().