Parametric Priority Rules: An Approach to Optimization in Priority Queues

K. R. Balachandran
Additional contact information
K. R. Balachandran: The University of Wisconsin, Milwaukee, Wisconsin

Operations Research, 1970, vol. 18, issue 3, 526-540

Abstract: This paper analyzes priority rules that are mixtures of preemption and postponable rules. Whether a preemption occurs is made to depend on some factor in addition to priority class; dependence on the completed portion of service (age) of the lower-priority customer in service and the number of prior preemptions of the lower-priority customer in service are each considered. The stochastic model (without priorities) is that of the M / G /1 queue. The paper obtains first-moment expressions (e.g., expected number of customers in the system) in the steady-state case for each priority class as a function of the particular factor being considered. It then introduces a linear cost model that is a function of expected waiting time and expected number of preemptions, and formulates the problem of finding an optimal rule from each class by considering a parametric class of rules determined by each factor. In each case, conditions are sought for the global optimality of a rule over a class of rules, but results are obtained only after restrictions (e.g., monotone failure rates) on service distributions are imposed.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.3.526 (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:18:y:1970:i:3:p:526-540

Access Statistics for this article

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