Queues in tandem with customer deadlines and retrials

Authors:
Josh Reed;Uri Yechiali
Affiliations:
Stern School of Business, New York University, New York, USA;Department of Statistics & Operations Research, Tel Aviv University, Tel Aviv, Israel
Venue:
Queueing Systems: Theory and Applications
Year:
2013

Citing 14
Cited 0

A tandem Jackson network with feedback to the first node

Queueing Systems: Theory and Applications
Routing in Queues with Delayed Information

Queueing Systems: Theory and Applications
Designing a Call Center with Impatient Customers

Manufacturing & Service Operations Management
Properties of the Reflected Ornstein–Uhlenbeck Process

Queueing Systems: Theory and Applications
Heavy-Traffic Limits for the G/H2*/n/m Queue

Mathematics of Operations Research
Analysis of customers' impatience in queues with server vacations

Queueing Systems: Theory and Applications
Jobshop-Like Queueing Systems

Management Science
Queues with system disasters and impatient customers when system is down

Queueing Systems: Theory and Applications
Queues where customers of one queue act as servers of the other queue

Queueing Systems: Theory and Applications
Infinite-server queues with system's additional tasks and impatient customers

Probability in the Engineering and Informational Sciences
Retrial networks with finite buffers and their application to internet data traffic

Probability in the Engineering and Informational Sciences
Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers

Operations Research
On tandem blocking queues with a common retrial queue

Computers and Operations Research
Accessible bibliography on retrial queues

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study queues in tandem with customer deadlines and retrials. We first consider a 2-queue Markovian system with blocking at the second queue, analyze it, and derive its stability condition. We then study a non-Markovian setting and derive the stability condition for an approximating diffusion, showing its similarity to the former condition. In the Markovian setting, we use probability generating functions and matrix analytic techniques. In the diffusion setting, we consider expectations of the first hitting times of compact sets.