Non-preemptive Priority Queueing
Non-Preemptive Priority Queueing is a queueing discipline in which customers are served according to their priority class, with higher-priority customers receiving preferential service, but once service has begun on a customer, it cannot be interrupted to serve another, even if a higher-priority customer arrives.
83
Publications
2.8K
Citations
175
Authors
92
Institutions
Publications per year
2017–2026
15
Variants
Non-preemptive Priority Queuing
Parents
83
1–5 of 83
175
4
h-index
University of California, Berkeley, United States
3 publications · 62 citations
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 175
92
AT&T (United States)
Bedminster, United States
4 h-index
4 publications
94 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
4 h-index
8 publications
390 citations

Belarusian State University
Minsk, Belarus
3 h-index
9 publications
186 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
397 citations
University of Michigan
Ann Arbor, United States
3 h-index
4 publications
143 citations
Tsinghua University
Beijing, China
3 h-index
5 publications
504 citations

Western University
London, Canada
3 h-index
3 publications
63 citations
The University of Texas at Austin
Austin, United States
2 h-index
3 publications
143 citations
1–8 of 92
9 publications · 295 citations
9
h-index
AAP · 4 publications · 161 citations
4
h-index
4 publications · 168 citations
4
h-index
4 publications · 146 citations
4
h-index
3 publications · 102 citations
3
h-index
1–5