The random order service G/M/m queue

Stig I. Rosenlund

Naval Research Logistics Quarterly, 1980, vol. 27, issue 2, 207-215

Abstract: The waiting time in the random order service G/M/m queue is studied. For the Laplace transform we obtain a simpler representation than previously available. For the moments, an explicit recursive algorithm is given and carried out numrically for some cases. This gives rise to the conjecture that the waiting‐time distributio can be approximated by the one for M/M/m after a suitable change of scale.

Date: 1980
References: Add references at CitEc
Citations:

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

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:27:y:1980:i:2:p:207-215

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 ().