Analysis of a discrete-time preemptive resume priority buffer
SCHEDULING DISCIPLINE
Technology and Engineering
queueing
preemptive resume priority
QUEUES
MODELS
0211 other engineering and technologies
general service times
02 engineering and technology
PERFORMANCE ANALYSIS
QUEUING-SYSTEMS
DOI:
10.1016/j.ejor.2007.01.028
Publication Date:
2007-02-21T07:16:36Z
AUTHORS (3)
ABSTRACT
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preemptive resume priority over customers of the other. Both classes contain customers with generally distributed service times. We show that the use of probability generating functions is beneficial for analyzing the system contents and customer delays of both classes. It is shown (theoretically as well as by some practical procedures) how moments and approximate tail probabilities of system contents and customer delays are calculated. The influence of the priority scheduling discipline and the service time distributions on the performance measures is shown by some numerical examples.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (24)
CITATIONS (18)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....