Computational results of multiserver bulk-arrival queues with constant service time MX/D/c.

The authors present an algorithm for numerically finding the limiting distribution of the number in the system for the bulk-arrival, multiserver queueing system M^X/D/c. Sample numerical results and graphs of various quantities of interest are also presented. In all cases, the proposed method is computationally efficient, accurate and reliable for both high and low values of the model parameters. The procedure is adaptable to other queueing models in discrete and continuous time, to problems in inventory control, the theory of dams, etc. Exact results found here will also be found useful by people dealing with inequalities, bounds, and approximations.