Some problems in queueing with dynamic priorities

James R. Jackson

Naval Research Logistics Quarterly, 1960, vol. 7, issue 3, 235-249

Abstract: This paper presents some mathematical and numerical results concerning certain one‐machine discrete‐time queueing models, subject to various queue disciplines. Interest is focused upon systems in which service order is governed by “dynamic priorities,” under which a customer's relative priority is in effect upgraded with the passage of waiting time, so that the proportion of newcomers who can “step in front of him” becomes smaller and smaller as he waits.

Date: 1960
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1002/nav.3800070304

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:wly:navlog:v:7:y:1960:i:3:p:235-249

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().