Theory and numerical solution of a discrete queueing problem

J. Ponstein

Statistica Neerlandica, 1974, vol. 28, issue 3, 139-152

Abstract: Abstract A queueing problem is considered with one server, independent discrete inter‐arrival times, and independent discrete service times. The steady state distribution of the waiting time is approximated by means of the solution of certain linear equations and applying a generalization of the Lin‐Bairstow method for finding quadratic factors of polynomials.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.1974.tb00745.x

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:bla:stanee:v:28:y:1974:i:3:p:139-152

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().