Computational Results of Multiserver Bulk-Arrival Queues with Constant Service Time MX/D/c

M. L. Chaudhry, J. G. C. Templeton and J. Medhi
Additional contact information
M. L. Chaudhry: Royal Military College of Canada, Kingston, Ontario, Canada
J. G. C. Templeton: University of Toronto, Toronto, Ontario, Canada
J. Medhi: University of Toronto, Toronto, Ontario, Canada

Operations Research, 1992, vol. 40, issue 3-supplement-2, S229-S238

Abstract: We 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.

Keywords: queues: algorithms; approximations; bulk; exact solution; multiserver; roots (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.3.S229 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:40:y:1992:i:3-supplement-2:p:s229-s238

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().