Results 231 to 240 of about 6,164 (256)
Some of the next articles are maybe not open access.

Spatial Queues with Infinitely Many Servers

2003
Spatial Queues with infinitely many servers arise naturally as models for the planning process of mobile communication networks. A very useful concept has been developed by Cinlar [44], partly on the basis of Massey and Whitt [84]. This assumes single arrivals distributed in time as a non-homogeneous Poisson process. Every arrival chooses a position in
openaire   +1 more source

Learning to Schedule in Multiclass Many-Server Queues with Abandonment

Operations Research
How to Learn Which Customer Class to Serve Next? In “Learning to Schedule in Multiclass Many-Server Queues with Abandonment”, Zhong, Birge, and Ward tackle the challenge of scheduling (that is, how to choose the customer that a newly available server will serve) in a multiclass many-server queueing system where customers may abandon ...
Yueyang Zhong   +2 more
openaire   +1 more source

Some general results for many server queues

Advances in Applied Probability, 1973
Pollaczek's theory for the many server queue is generalized and extended. Pollaczek (1961) found the distribution of the actual waiting times in the model G/G/s as a solution of a set of integral equations.
openaire   +2 more sources

Conditions for ergodicity in queues with many servers and waiting

Siberian Mathematical Journal, 1983
Translation from Sib. Mat. Zh. 24, No.6(142), 168-175 (Russian) (1983; Zbl 0536.60091).
openaire   +1 more source

On the many server queue with exponential service times

Advances in Applied Probability, 1973
The general theory for the many server queue due to Pollaczek (1961) and generalized by the author (de Smit (1973)) is applied to the system with exponential service times. In this way many explicit results are obtained for the distributions of characteristic quantities, such as the actual waiting time, the virtual waiting time, the queue length, the ...
openaire   +2 more sources

Many server queueing systems

1971
Electrical Engineering, Mathematics and Computer ...
openaire   +1 more source

Existence and uniqueness of a fluid model for many-server queues with abandonment

Operations Research Letters, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On Uniform Exponential Ergodicity of Markovian Multiclass Many-Server Queues in the Halfin–Whitt Regime

Mathematics of Operations Research, 2021
Ari Arapostathis   +2 more
exaly  

Many-server queues with customer abandonment.

2011
Customer call centers with hundreds of agents working in parallel are ubiquitous in many industries. These systems have a large amount of daily traffic that is stochastic in nature. It becomes more and more difficult to manage a call center because of its increasingly large scale and the stochastic variability in arrival and service processes.
openaire   +1 more source

Home - About - Disclaimer - Privacy