A new method to solve steady state queueing equations

W. K. Grassmann and M. L. Chaudhry

Naval Research Logistics Quarterly, 1982, vol. 29, issue 3, 461-473

Abstract: There are a great number of queueing systems, including the MX/MY/c, the GlX/M/c and the discrete Gl/G/1 queue in which the state probabilities are determined by repeated queue equations. This paper gives a simple, efficient and numerically stable algorithm to caiculate the state probabilities and measure of performance for such systems. The method avoids both complex arithmetric and matrix manipulations.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/nav.3800290308

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:wly:navlog:v:29:y:1982:i:3:p:461-473

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().