M/G/1 queueing system with "fagging'' service channel
W. Szczotka (1973)
Applicationes Mathematicae
Similarity:
W. Szczotka (1973)
Applicationes Mathematicae
Similarity:
J. Bartoszewicz, T. Rolski (1970)
Applicationes Mathematicae
Similarity:
W. Szczotka (1974)
Applicationes Mathematicae
Similarity:
R. Szekli (1984)
Applicationes Mathematicae
Similarity:
I. Kopocińska (1970)
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...
Dshalalow, Jewgeni H., Yellen, Jay (1996)
Mathematical Problems in Engineering
Similarity:
H. G. Perros (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
B. Kopociński (1973)
Applicationes Mathematicae
Similarity:
Lee, Ho Woo, Lee, Soon Seok, Chae, K.C. (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
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 ...
Medhi Pallabi, Amit Choudhury (2012)
RAIRO - Operations Research - Recherche Opérationnelle
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 form expressions of a number of performance measures...