Work-conserving priorities
- 1 August 1970
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 7 (2) , 327-337
- https://doi.org/10.2307/3211968
Abstract
In many situations, it is reasonable to assume that a priority rule does not affect the total time spent in service of any job. Rules with this property are said to bework-conserving.This concept unifies and simplifies the analysis of a variety of priority queues. Some results are obtained for rules applied to theGI/G/1 queue. Some special properties of Poisson arrivals are discussed, and a new proof of the equivalence of averaging over all time with averaging over arrival epochs is presented. In this case, explicit results for particular rules are obtained in examples. In another example, the optimal rule (from a very restrictive class) is determined without specializing the arrival stream.Keywords
This publication has 12 references indexed in Scilit:
- Two Queues Attended by a Single ServerOperations Research, 1968
- Queuing with Alternating PrioritiesOperations Research, 1965
- On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional ServiceOperations Research, 1964
- Priority QueuesOperations Research, 1964
- Letter to the Editor—An Alternate Derivation of the Pollaczek-Khintchine FormulaOperations Research, 1964
- Some Queuing Problems with the Service Station Subject to BreakdownOperations Research, 1963
- A Waiting Line with Interrupted Service, Including PrioritiesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1962
- A Proof for the Queuing Formula: L = λWOperations Research, 1961
- On the Characteristics of the General Queueing Process, with Applications to Random WalkThe Annals of Mathematical Statistics, 1956
- Priority Assignment in Waiting Line ProblemsJournal of the Operations Research Society of America, 1954