Queueing systems with feedback
I. Kopocińska, B. Kopociński (1971)
Applicationes Mathematicae
Similarity:
I. Kopocińska, B. Kopociński (1971)
Applicationes Mathematicae
Similarity:
(1966)
Applicationes Mathematicae
Similarity:
Teresa Ryba (1973)
Applicationes Mathematicae
Similarity:
Gang Chen, Zhong Yang (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Gang Chen, Zhong Yang (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Cooper, Robert B., Niu, Shun-Chen, Srinivasan, Mandyam M. (1998)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Muh, David C.R. (1993)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Bérczes, Tamás (2008)
Annales Mathematicae et Informaticae
Similarity:
Amit Choudhury, Pallabi Medhi (2011)
RAIRO - Operations Research
Similarity:
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit...
Amit Choudhury, Pallabi Medhi (2011)
RAIRO - Operations Research
Similarity:
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit...
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:
Lee, Ho Woo, Ahn, Boo Yong (2000)
Mathematical Problems in Engineering
Similarity: