A single-server queue with random accumulation level.
Dshalalow, Jewgeni H. (1991)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Dshalalow, Jewgeni H. (1991)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
E. Gelenbe, R. Iasnogorodski (1980)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Dukhovny, Alexander (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Chesoong Kim, Alexander Dudin, Sergey Dudin, Olga Dudina (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Dudin, Alexander N., Klimenok, Valentina I. (1999)
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:
Tadj, Lotfi, Benkherouf, Lakdere, Aggoun, Lakhdar (1998)
Mathematical Problems in Engineering
Similarity:
Abolnikov, Lev, Dshalalow, Jewgeni H. (1992)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Dshalalow, Jewgeni H., Tadj, Lotfi (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Dudin, Alexander N., Klimenok, Valentina I. (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Tadj, Lotfi (2000)
Mathematical Problems in Engineering
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...