A new method to solve steady state queueing equations

DOI10.1002/NAV.3800290308MaRDI QIDQ3657177zbMATH OpenOpenAlexFDO

Authors Winfried K. Grassmann, M. L. Chaudhry

Publication date 1982

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800290308

zbMATH Keywords

algorithm for calculating state probabilitiesequilibrium probabilities

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Cited in

(6)

• Computational analysis of single-server bulk-arrival queues: GI X/M/1
• Analysis of the stationary \(E_ k/C_ 2/s\) queueing system
• On a batch service queue with single vacation
• Computational analysis of steady-state probabilities of \(M/G^{a,b}/1\) and related nonbulk queues
• A note on some relations in the queue GI^ X/M/c
• Duality properties of a one-dimensional random walk and a new computational algorithm

This page was built for publication: A new method to solve steady state queueing equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3657177)