Back to Search
Start Over
On the Busy Periods of Single-Server Queues with Poisson Input and General Service Times.
- Source :
- Operations Research; May/Jun76, Vol. 24 Issue 3, p564, 8p
- Publication Year :
- 1976
-
Abstract
- We consider a single-server queue with Poisson input and general service times and determine the following probabilities: the probability that a busy period has length * (This character cannot be converted in ASCII text) x and the maximal queue size during the busy period is * (This character cannot be converted in ASCII text) k, and the probability that a busy period has length * (This character cannot be converted in ASCII text) x and the maximal virtual waiting time during the busy period is * (This character cannot be converted in ASCII text) y. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0030364X
- Volume :
- 24
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 6665130
- Full Text :
- https://doi.org/10.1287/opre.24.3.564