Sojourn-time Distribution for M/Ga/1 Queue with Batch Service of Fixed Size - Revisited
This paper presents an explicit and straightforward method for finding the sojourn-time distribution of a random customer in an M / G a / 1 queue with a fixed-size batch service. The exhibited process is much more straightforward than the approach discussed by Yu and Tang (Methodology and Computing...
Saved in:
| Published in: | Methodology and computing in applied probability Vol. 24; no. 4; pp. 2897 - 2912 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.12.2022
Springer Nature B.V |
| Subjects: | |
| ISSN: | 1387-5841, 1573-7713 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!