The Modified M/G/1 queue
D. G. Tambouratzis (1973)
Δελτίο της Ελληνικής Μαθηματικής Εταιρίας
Similarity:
Displaying similar documents to “A Generalization of the M/G/1 Queue”
The Modified M/G/1 queue
Hypergroups defined from a linear space
J. Mittas, Ch. G. Massouros (1989)
Δελτίο της Ελληνικής Μαθηματικής Εταιρίας
Similarity:
The rate of satiation in a cooperative system
George Karakostas (1989)
Δελτίο της Ελληνικής Μαθηματικής Εταιρίας
Similarity:
On the Direct Solution of Preconditioned Linear Equations
D. J. Evans, M. Hatzopoylos (1975)
Δελτίο της Ελληνικής Μαθηματικής Εταιρίας
Similarity:
On Levin΄s Comparison Theorem
B. S. Lalli, R. P. Jahagirdar (1972)
Δελτίο της Ελληνικής Μαθηματικής Εταιρίας
Similarity:
A fixed-size batch service queue with vacations.
Lee, Ho Woo, Lee, Soon Seok, Chae, K.C. (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
The queue with queue length dependent service times.
Choi, Bong Dae, Kim, Yeong Cheol, Shin, Yang Woo, Pearce, Charles E.M. (2001)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Joint distribution of waiting time and queue size for single server queues
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
On an queueing system.
Tadj, Lotfi (2000)
Mathematical Problems in Engineering
Similarity:
An queue with close-down and vacation times.
Frey, Andreas, Takahashi, Yoshitaka (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Analyzing discrete-time bulk-service queue
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...