Stationary delays for a two-class priority queue with impatient customers

Authors:
Oualid Jouini;Yves Dallery
Affiliations:
Ecole Centrale Paris, Châtenay-Malabry Cedex, France;Ecole Centrale Paris, Châtenay-Malabry Cedex, France
Venue:
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Year:
2007

Citing 14
Cited 0

Fundamentals of queueing theory (2nd ed.).

Fundamentals of queueing theory (2nd ed.).
Improving Service by Informing Customers About Anticipated Delays

Management Science
On the stability of retrial queues

Queueing Systems: Theory and Applications
On queueing with customer impatience until the beginning of service

Queueing Systems: Theory and Applications
M/M/1 Queue with Impatient Customers of Higher Priority

Queueing Systems: Theory and Applications
Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System

Queueing Systems: Theory and Applications
A Diffusion Approximation for a Markovian Queue with Reneging

Queueing Systems: Theory and Applications
The Nonpreemptive Priority Map/G/1 Queue

Operations Research
Designing a Call Center with Impatient Customers

Manufacturing & Service Operations Management
Commissioned Paper: Telephone Call Centers: Tutorial, Review, and Research Prospects

Manufacturing & Service Operations Management
On the Two-Class M/M/1 System under Preemptive Resume and Impatience of the Prioritized Customers

Queueing Systems: Theory and Applications
An Exact Solution for the State Probabilities of the Multi-Class, Multi-Server Queue with Preemptive Priorities

Queueing Systems: Theory and Applications
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Multi-Server Queueing Systems with Multiple Priority Classes

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a Markovian multiserver queue with two types of impatient customers, high and low priority ones. The first type of customers has a non-preemptive strict priority over the other type. After entering the queue, a customer will wait a random length of time for service to begin. If service has not begun by this time he will renege and be lost. We focus on deriving performance measures in terms of the sojourn times of customers in queue, either before starting service, or before reneging. We provide an exact analysis for systems where customers within each type are served under the FCFS discipline of service.