The random order service G/M/m queue |
| |
Authors: | Stig I. Rosenlund |
| |
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. |
| |
Keywords: | |
|
|