Results 211 to 220 of about 6,164 (256)

Customer Abandonment in Many-Server Queues

Mathematics of Operations Research, 2010
We study G/G/n + GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer's waiting time in queue exceeds his patience time, the customer abandons the system without service.
J G Dai, Shuangchi He
exaly   +2 more sources

Algorithms for Time-Varying Networks of Many-Server Fluid Queues

INFORMS Journal on Computing, 2014
Motivated by large-scale service systems with network structure, we introduced in a previous paper a time-varying open network of many-server fluid queues with customer abandonment from each queue and time-varying proportional routing among the queues, and showed how performance functions can be determined.
Yunan Liu, Ward Whitt
exaly   +3 more sources

Fluid models for many-server Markovian queues in a changing environment [PDF]

Operations Research Letters, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
B. Zhang (Bo), A.P. Zwart (Bert)
openaire   +3 more sources

The Impact of Delay Announcements in Many-Server Queues with Abandonment

Operations Research, 2009
This paper studies the performance impact of making delay announcements to arriving customers who must wait before starting service in a many-server queue with customer abandonment. The queue is assumed to be invisible to waiting customers, as in most customer contact centers, when contact is made by telephone, e-mail, or instant messaging.
Mor Armony, Nahum Shimkin, Ward Whitt
exaly   +2 more sources

A Network of Time-Varying Many-Server Fluid Queues with Customer Abandonment [PDF]

Operations Research, 2011
To describe the congestion in large-scale service systems, we introduce and analyze a non-Markovian open network of many-server fluid queues with customer abandonment, proportional routing, and time-varying model elements.
Yunan Liu, Ward Whitt
exaly   +2 more sources

Erratum to “On many-server queues in heavy traffic”

The Annals of Applied Probability, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Puhalskii, Anatolii A., Reed, Josh E.
openaire   +1 more source

A Many-Server Queue with Service Interruptions

Operations Research, 1968
A steady-state M/M/N queuing system where each server is subject to random breakdowns of exponentially distributed duration is studied and analyzed. The moment generating function of the queue size is obtained in explicit form for N≦ 2. For larger values of N a numerical method is suggested.
Mitrani I, Avi-Itzhak B
openaire   +2 more sources

Staffing many‐server queues with autoregressive inputs

Naval Research Logistics (NRL), 2020
AbstractRecent studies reveal significant overdispersion and autocorrelation in arrival data at service systems such as call centers and hospital emergency departments. These findings stimulate the needs for more practical non‐Poisson customer arrival models, and more importantly, new staffing formulas to account for the autocorrelative features in the
Xu Sun, Yunan Liu
openaire   +1 more source

Queues with Many Servers and Impatient Customers

Mathematics of Operations Research, 2012
The asymptotic many-server queue with abandonments, G/GI/N + GI, is considered in the quality- and efficiency-driven (QED) regime. Here the number of servers and the offered load are related via the square-root rule, as the number of servers increases indefinitely.
Avishai Mandelbaum, Petar Momcilovic
openaire   +1 more source

A note on a limit interchange for many-server queues

Operations Research Letters, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Pei, Amir Motaei, Petar Momcilovic
openaire   +1 more source