scholarly journals Multi-server preemptive priority queue with general arrivals and service times

2017 ◽  
Vol 115 ◽  
pp. 150-164 ◽  
Author(s):  
Alexandre Brandwajn ◽  
Thomas Begin
Keyword(s):  
Priority Queue ◽  
Preemptive Priority ◽  
Service Times ◽  
Multi Server

An ME-based approximation for multi-server queues with preemptive priority

1994 ◽  
Vol 77 (3) ◽  
pp. 496-515 ◽  
Author(s):  
Demetres Kouvatsos ◽  
Nasredine Tabet-Aouel
Keyword(s):  
Preemptive Priority ◽  
Multi Server

Comparing multi-server queues with finite waiting rooms, I: Same number of servers

1979 ◽  
Vol 11 (2) ◽  
pp. 439-447 ◽  
Author(s):  
David Sonderman
Keyword(s):  
Queueing Systems ◽  
Stochastic Comparisons ◽  
Waiting Room ◽  
Service Times ◽  
Interarrival Times ◽  
Multi Server

We compare two queueing systems with the same number of servers that differ by having stochastically ordered service times and/or interarrival times as well as different waiting room capacities. We establish comparisons for the sequences of actual-arrival and departure epochs, and demonstrate by counterexample that many stochastic comparisons possible with infinite waiting rooms no longer hold with finite waiting rooms.

Analysis of a finite capacity non preemptive priority queue

1984 ◽  
Vol 11 (3) ◽  
pp. 337-343 ◽  
Author(s):  
Asha Seth Kapadia ◽  
Mohammad Fasihullah Kazmi ◽  
A.Cameron Mitchell
Keyword(s):  
Priority Queue ◽  
Finite Capacity ◽  
Preemptive Priority

Stochastic bounds for heterogeneous-server queues with Erlang service times

1974 ◽  
Vol 11 (04) ◽  
pp. 785-796 ◽  
Author(s):  
Oliver S. Yu
Keyword(s):  
Steady State ◽  
Queue Length ◽  
Heavy Traffic ◽  
Waiting Times ◽  
Single Server ◽  
Shape Parameters ◽  
Server Queue ◽  
Service Times ◽  
Heavy Traffic Approximations ◽  
Multi Server

This paper establishes stochastic bounds for the phasal departure times of a heterogeneous-server queue with a recurrent input and Erlang service times. The multi-server queue is bounded by a simple GI/E/1 queue. When the shape parameters of the Erlang service-time distributions of different servers are the same, these relations yield two-sided bounds for customer waiting times and the queue length, which can in turn be used with known results for single-server queues to obtain characterizations of steady-state distributions and heavy-traffic approximations.

Sign in / Sign up

Export Citation Format

Share Document