Results 11 to 20 of about 33,611 (226)
Rare-Event Simulation for Many-Server Queues [PDF]
We develop rare-event simulation methodology for the analysis of loss events in a many-server loss system under the quality-driven regime, focusing on the steady-state loss probability (i.e., fraction of lost customers over arrivals) and the behavior of the whole system leading to loss events. The analysis of these events requires working with the full
Blanchet, Jose, Lam, Henry
openaire +4 more sources
Fluid Models of Many-server Queues with Abandonment [PDF]
We study many-server queues with abandonment in which customers have general service and patience time distributions. The dynamics of the system are modeled using measure- valued processes, to keep track of the residual service and patience times of each
A. Mandelbaum +33 more
core +5 more sources
Many-server diffusion limits for $G/Ph/n+GI$ queues [PDF]
This paper studies many-server limits for multi-server queues that have a phase-type service time distribution and allow for customer abandonment. The first set of limit theorems is for critically loaded $G/Ph/n+GI$ queues, where the patience times are ...
Dai, J. G., He, Shuangchi, Tezcan, Tolga
core +3 more sources
On many-server queues in heavy traffic
We establish a heavy-traffic limit theorem on convergence in distribution for the number of customers in a many-server queue when the number of servers tends to infinity. No critical loading condition is assumed.
Puhalskii, Anatolii A., Reed, Josh E.
core +4 more sources
Optimal Control of Markov-Modulated Multiclass Many-Server Queues [PDF]
We study multiclass many-server queues for which the arrival, service, and abandonment rates are all modulated by a common finite-state Markov process. We assume that the system operates in the “averaged” Halfin–Whitt regime, which means that it is critically loaded in the average sense although not necessarily in each state of the Markov process.
Ari Arapostathis +3 more
openaire +4 more sources
Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues [PDF]
This paper presents a novel and computationally efficient methodology for approximating the queue length (the number of customers in the system) distributions of time-varying non-Markovian many-server queues (e.g., Gt/Gt/nt queues), where the number of servers (nt) is large. Our methodology consists of two steps.
Jamol Pender, Young Myoung Ko
openaire +5 more sources
Fluid limits of many-server queues with reneging
This work considers a many-server queueing system in which impatient customers with i.i.d., generally distributed service times and i.i.d., generally distributed patience times enter service in the order of arrival and abandon the queue if the time ...
Kang, Weining, Ramanan, Kavita
core +4 more sources
SPDE limits of many-server queues
A many-server queueing system is considered in which customers with independent and identically distributed service times enter service in the order of arrival. The state of the system is represented by a process that describes the total number of customers in the system, as well as a measure-valued process that keeps track of the ages of customers in ...
Kaspi, Haya, Ramanan, Kavita
openaire +4 more sources
Queuing System with Two Types of Customers and Dynamic Change of a Priority
The use of priorities allows us to improve the quality of service of inhomogeneous customers in telecommunication networks, inventory and health-care systems. An important modern direction of research is to analyze systems in which priority of a customer
Valentina Klimenok +3 more
doaj +1 more source
Queues or waiting lines are an integral part of health care facilities such as hospitals, outpatient clinics, medical laboratories, and many other health facilities. Health care management must have waiting lines control strategies for smooth functioning.
Godlove Suila Kuaban +3 more
doaj +1 more source

