Hostname: page-component-5cf477f64f-xc2pj Total loading time: 0 Render date: 2025-04-03T03:44:25.888Z Has data issue: false hasContentIssue false
  • English
  • Français

A solvable model for a finite-capacity queueing system

Published online by Cambridge University Press:  24 August 2016

J. Newton
J. Newton*
Affiliation:
University of St Andrews
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Letters to the Editor
Information
Journal of Applied Probability , Volume 23 , Issue 4 , December 1986 , pp. 1045 - 1047
Copyright
Copyright © Applied Probability Trust 1986 

References

[1] Conolly, B. W. (1975) Queueing Systems. Ellis Horwood, Chichester.Google Scholar
[2] Cox, D. R. (1962) Renewal Theory. Methuen, London.Google Scholar
[3] Giorno, V., Negri, C. and Nobile, A. G. (1985) A solvable model for a finite-capacity queueing system. J. Appl. Prob. 22, 903–911.CrossRefGoogle Scholar
[4] Keilson, J. (1979) Markov Chain Models — Rarity and Exponentiality., Applied Mathematical Sciences Series 28, Springer-Verlag, Berlin.CrossRefGoogle Scholar