Loading…
Technical Note--A Note on the Busy Period of an M/G/1 Finite Queue
Recursive formulas for computing the Laplace-Stieltjes transform and the mean of the distribution of the lengths of busy periods for the M / G /1 finite queue are derived by a simple method that avoids simultaneous equations.
Saved in:
| Published in: | Operations research 1975-12, Vol.23 (6), p.1179-1182 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Citations: | Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Recursive formulas for computing the Laplace-Stieltjes transform and the mean of the distribution of the lengths of busy periods for the M / G /1 finite queue are derived by a simple method that avoids simultaneous equations. |
|---|---|
| ISSN: | 0030-364X 1526-5463 |
| DOI: | 10.1287/opre.23.6.1179 |