Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-25T19:30:55.118Z Has data issue: false hasContentIssue false
  • English
  • Français

Acknowledgement

Published online by Cambridge University Press:  14 July 2016

W. Stadje
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Other
Information
Journal of Applied Probability , Volume 24 , Issue 1 , March 1987 , pp. 290
Copyright
Copyright © Applied Probability Trust 1987 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Conolly, B. W. (1971) The busy period for the infinite capacity service system M/G/8. In: Studi di probabilitità, statistica e ricerca operativa in onore di Giuseppe Pompilj. Oderisi, Gubbio.Google Scholar
Shanbhag, D. N. (1966) On infinite server queues with batch arrivals. J. Appl. Prob., 3, 274–279.10.2307/3212053Google Scholar
Stadje, W. (1985) The busy period of the queueing system M/G/8. J. Appl. Prob. 22, 697–704.10.2307/3213872Google Scholar
Takács, L. (1962) Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar