IEEE Transactions on Communications · 1993 · 60 citations · 11 references
BusinessIndustrial EngineeringMarkov Decision ProcessesQueuing TheorySchedulingPriority QueuesQueue DisciplineQueueing AnalysisQueueing ProcessesQueueing SystemsQueueing TheoryLaplace TransformNon-preemptive Priority QueueingNon-preemptive Priority QueuesPreemptive Priority QueueingPreemptive Priority QueuesPriority QueueingQueueing ControlResponse Time
The authors propose a combined preemptive/nonpreemptive priority discipline. When a high-priority job arrives at the system while a low-priority job is being in service, the high-priority job will be served immediately and the low-priority job will go back to the head of the queue of its class, if a discretion rule for preemption is satisfied. Otherwise, the high-priority job waits in queue until the completion of the low-priority job service. As the discretion rule for preemption, three schemes are considered, each based on the parameter of the low-priority job: the elapsed service time, the ratio of elapsed to total service time, and the remaining service time. Using the busy-period analysis technique, an M/G/1 queueing system with multiple priority classes of jobs is analyzed. Considered preemptive rules are the preemptive-resume and preemptive-repeat-identical policies. As results, the Laplace transforms associated with waiting time and response time, and the z-transform for the number of jobs in the system as well as their expectations are presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
11
Poisson Arrivals See Time Averages
Ronald W. Wolff · Operations Research · 1982 · 1.2K citations
Introduction to the Theory of Queues.
G. F. Newell, Lajos Takács · American Mathematical Monthly · 1963 · 981 citations