Immediate service in a Beneš-type G/G/1 queueing system
W. Szczotka (1974)
Applicationes Mathematicae
Similarity:
W. Szczotka (1974)
Applicationes Mathematicae
Similarity:
R. Szekli (1984)
Applicationes Mathematicae
Similarity:
J. Bartoszewicz, T. Rolski (1970)
Applicationes Mathematicae
Similarity:
I. Kopocińska (1970)
Applicationes Mathematicae
Similarity:
W. Szczotka (1973)
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.
Lee, Ho Woo, Lee, Soon Seok, Chae, K.C. (1996)
Journal of Applied Mathematics and Stochastic Analysis
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...
Gupta, U.C., Sikdar, Karabi (2004)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Kailash C. Madan, Walid Abu-Dayyeh (2002)
ESAIM: Probability and Statistics
Similarity:
We investigate the steady state behavior of an //1 queue with modified Bernoulli schedule server vacations. Batches of variable size arrive at the system according to a compound Poisson process. However, all arriving batches are not allowed into the system. The restriction policy differs when the server is available in the system and when he is on vacation. We obtain in closed form, the steady state probability generating functions for the number of customers in the queue for various...
Dshalalow, Jewgeni H., Yellen, Jay (1996)
Mathematical Problems in Engineering
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 ...
Gupta, U.C., Banik, A.D., Pathak, S.S. (2005)
Journal of Applied Mathematics and Stochastic Analysis
Similarity: