| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143418 | Operations Research Letters | 2006 | 9 Pages |
Abstract
Since the GI/G/cGI/G/c queue with general batch arrival and batch service patterns cannot be solved exactly, an approximate solution is proposed. The approach is based on a three-part classification of delay: batching time, queueing time and service time, and is subsequently compared with discrete event simulation as benchmark.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Thomas Hanschke,