Abstract
In this paper we consider the MX/G/I queueing system with batch arrivals. We give simple approximations for the waiting-time probabilities of individual customers. These approximations are checked numerically and they are found toperform very well for a wide variety of batch-size and service-timed distributions.
| Original language | English |
|---|---|
| Pages (from-to) | 678-685 |
| Number of pages | 13 |
| Journal | Operations research |
| Volume | 38 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1990 |
Fingerprint
Dive into the research topics of 'Simple approximations for the batch-arrival MX/G/1 queue'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver