2015
DOI: 10.1007/s11009-015-9476-1
|View full text |Cite
|
Sign up to set email alerts
|

Waiting Time Distributions in the Preemptive Accumulating Priority Queue

Abstract: We consider a queueing system in which a single server attends to N priority classes of customers. Upon arrival to the system, a customer begins to accumulate priority linearly at a rate which is distinct to the class to which it belongs. Customers with greater accumulated priority levels are given preferential treatment in the sense that at every service selection instant, the customer with the greatest accumulated priority level is selected next for servicing. Furthermore, the system is preemptive so that th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0
1

Year Published

2016
2016
2025
2025

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 20 publications
(14 citation statements)
references
References 20 publications
0
13
0
1
Order By: Relevance
“…Kumar et al [8] present a hybrid priority queue architecture and a scalable task scheduler for real-time systems that reduces scheduler processing overhead and improves timing determinism of the scheduler. Fajardo and Drekic [9] proposed the concept of cumulative priority, the main purpose is to describe the latency distribution of each queue. The system is preemptive, so as to serve customers with higher cumulative priority.…”
Section: Related Workmentioning
confidence: 99%
“…Kumar et al [8] present a hybrid priority queue architecture and a scalable task scheduler for real-time systems that reduces scheduler processing overhead and improves timing determinism of the scheduler. Fajardo and Drekic [9] proposed the concept of cumulative priority, the main purpose is to describe the latency distribution of each queue. The system is preemptive, so as to serve customers with higher cumulative priority.…”
Section: Related Workmentioning
confidence: 99%
“…4. The fourth priority policy is a dynamic priority policy that implements an accumulating priority queue where a patient's priority is a linear function of his waiting time in the physician queue (Fajardo & Drekic, 2017;Li & Stanford, 2016;Sharif, Stanford, Taylor & Ziedins, 2014;. As indicated by Ferrand et al (2018), such a policy is suited for ED applications.…”
Section: Analysed Scenariosmentioning
confidence: 99%
“…5. The fifth and final scenario implements an accumulating priority queue where a patient's priority is a linear function of his or her waiting time in the internal queue (Fajardo & Drekic, 2017;Li & Stanford, 2016;Sharif, Stanford, Taylor & Ziedins, 2014;. The rate at which the priority increases depends on the patient type i ( ∈ { , } where t stands for test patients and b for boarding patients).…”
Section: Scenariosmentioning
confidence: 99%