(N,n)-preemptive priority queues
Performance Evaluation
Computers and Operations Research
Hi-index | 0.00 |
This paper presents formulas for calculating waiting time for customers in a queue with combined preemptive and head-of-line (nonpreemptive) priority scheduling disciplines and describes the reasoning behind them. This work has been applied in the development of programmable terminal control units.