Identification of waiting time distribution of M/G/1, M x/G/1, GI r/M/1 queueing systems.
Ghosal, A., Madan, S. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Ghosal, A., Madan, S. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
R. G. Rani (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Władysław Szczotka
Similarity:
CONTENTS1. Introduction...................................................................52. Preliminaries................................................................113. Departure process......................................................194. Joint distribution of waiting time and queue size..........325. New forms of Little's formula.......................................38References.....................................................................53
Loris-Teghem, J. (2000)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Loris-Teghem, Jacqueline (2000)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Natalia V. Djellab (2006)
The Yugoslav Journal of Operations Research
Similarity:
Shin, Yang Woo (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
I. Kopocińska, B. Kopociński (1977)
Applicationes Mathematicae
Similarity:
Arianna Brugno, Ciro D'Apice, Alexander Dudin, Rosanna Manzo (2017)
International Journal of Applied Mathematics and Computer Science
Similarity:
A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size. If the number of customers in the system at the service completion moment is less than this size, the server does not start the next service until the number of customers in the system reaches this size or a random limitation of the idle time of the server expires, whichever occurs first. Customers arrive according to a Markovian...
Frey, Andreas, Takahashi, Yoshitaka (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Kasahara, Shoji, Takagi, Hideaki, Takahashi, Yutaka, Hasegawa, Toshiharu (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Natalia V. Djellab (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.
Matendo, Sadrac K. (1994)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Choi, Bong Dae, Kim, Yeong Cheol, Shin, Yang Woo, Pearce, Charles E.M. (2001)
Journal of Applied Mathematics and Stochastic Analysis
Similarity: