Results 211 to 220 of about 25,343 (268)
Some of the next articles are maybe not open access.

Related searches:

On Episodic Queues

SIAM Journal on Matrix Analysis and Applications, 1997
Summary: For a queueing system with a low traffic intensity, the expected number of customers in the queue is small. However, with a bursty input process, long queues may build up in a short time. We study light traffic queueing systems with bursty input processes. We study the distributions of queue lengths, waiting times, busy and active periods, and
Qi-Ming He, Marcel F. Neuts
openaire   +1 more source

Queueing for Healthcare

Journal of Medical Systems, 2010
Patient queues are prevalent in healthcare and wait time is one measure of access to care. We illustrate Queueing Theory-an analytical tool that has provided many insights to service providers when designing new service systems and managing existing ones.
R. Kannapiran Palvannan, Kiok Liang Teow
openaire   +2 more sources

Nonstationary analysis of the loss queue and of queueing networks of loss queues

European Journal of Operational Research, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khalid Abdulaziz Alnowibet   +1 more
openaire   +1 more source

A fluid queue driven by a Markovian queue

Queueing Systems, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruno Sericola, Bruno Tuffin
openaire   +1 more source

Finite Queues and Cyclic Queues

Operations Research, 1960
The finite queue problem, for which tables exist [Peck, L. G., R. N. Hazelwood. 1958. Finite Queuing Tables. ORSA Publications in Operations Research No. 2. Wiley, New York.], is a special case of the cyclic queue [Koenigsberg, E. 1958. Oper. Res. Quart. 9 22–35].
openaire   +1 more source

Queues where customers of one queue act as servers of the other queue

Queueing Systems, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Efrat Perel, Uri Yechiali
openaire   +1 more source

QUEUEING WITH BALKING

Biometrika, 1957
In dealing with problems of queueing, several writers (Kolmogoroff, 1932; Erlang*; Kendall, 1951, 1953; Lindley, 1952; Takacs, 1955) have discussed the situation where queue stability is obtained by assuming that the demand for service does not overload the service mechanism.
openaire   +1 more source

Home - About - Disclaimer - Privacy