Immediate service in a Beneš-type G/G/1 queueing system
W. Szczotka (1974)
Applicationes Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
W. Szczotka (1974)
Applicationes Mathematicae
Similarity:
P. Vijaya Laxmi, Kanithi Jyothsna (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
This paper analyzes a discrete-time finite buffer renewal input queue with multiple working vacations where services are performed in batches of maximum size “”. The service times both during a regular service period and vacation period and vacation times are geometrically distributed. Employing the supplementary variable and imbedded Markov chain techniques, we derive the steady-state queue length distributions at pre-arrival, arbitrary and outside observer’s observation epochs. Based...
B. Kopociński (1973)
Applicationes Mathematicae
Similarity:
Veena Goswami, Umesh C. Gupta, Sujit K. Samanta (2006)
RAIRO - Operations Research
Similarity:
This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time...
H. G. Perros (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
W. Szczotka (1973)
Applicationes Mathematicae
Similarity:
J. Bartoszewicz, T. Rolski (1970)
Applicationes Mathematicae
Similarity:
R. Szekli (1984)
Applicationes Mathematicae
Similarity:
Saulius Minkevičius (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The object of this research in the queueing theory is a theorem about the Strong-Law-of-Large-Numbers (SLLN) under the conditions of heavy traffic in a multiserver open queueing network. SLLN is known as a fluid limit or fluid approximation. In this work, we prove that the long-term average rate of growth of the queue length process of a multiserver open queueing network under heavy traffic strongly converges to a particular vector of rates. SLLN is proved for the values of an important...
I. Kopocińska (1970)
Applicationes Mathematicae
Similarity:
V. Jailaxmi, R. Arumuganathan, M. Senthil Kumar (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
This paper analyses an M/G/1 retrial queue with working vacation and constant retrial policy. As soon as the system becomes empty, the server begins a working vacation. The server works with different service rates rather than completely stopping service during a vacation. We construct the mathematical model and derive the steady-state queue distribution of number of customer in the retrial group. The effects of various performance measures are derived.
Gupta, U.C., Sikdar, Karabi (2004)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Medhi Pallabi, Amit Choudhury (2012)
RAIRO - Operations Research
Similarity:
In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed ...