Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-06-03T01:06:34.421Z Has data issue: false hasContentIssue false
  • English
  • Français

Approximations in finite-capacity multi-server queues by Poisson arrivals

Published online by Cambridge University Press:  14 July 2016

Shirley A. Nozaki  and
Sheldon M. Ross
Shirley A. Nozaki
Affiliation:
University of California, Berkeley
Sheldon M. Ross
Affiliation:
University of California, Berkeley
Get access Rights & Permissions [Opens in a new window]

Abstract

An approximation for the average delay in queue of an entering customer is presented for the M/G/K queuing model with finite capacity. The approximation is obtained by means of an approximation relating a joint distribution of remaining service time to the equilibrium service distribution.

Keywords

MULTISERVERFINITE CAPACITYPOISSON ARRIVALAVERAGE DELAYAPPROXIMATION
Type
Research Papers
Information
Journal of Applied Probability , Volume 15 , Issue 4 , December 1978 , pp. 826 - 834
Copyright
Copyright © Applied Probability Trust 1978 

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

[1] Brumelle, S. L. (1971) On the relation between customer and time averages in queues. J. Appl. Prob. 8, 508–520.Google Scholar
[2] Brumelle, S. L. (1972) A generalization of L = ?W to moments of queue length and waiting times. Opns Res. 20, 1127–1136.Google Scholar
[3] Hillier, F. S. and Lo, F. D. (1971) Tables for multi-server queueing systems involving Erlang distributions. Technical Report No. 31. Department of Operations Research, Stanford University.Google Scholar
[4] Kingman, J. F. C. (1970) Inequalities in the theory of queues. J. R. Statist. Soc. B 32, 102–110.Google Scholar
[5] Kingman, J. F. C. (1965) The heavy traffic approximation in the theory of queues. In Proceedings of the Symposium on Congestion Theory , University of North Carolina, 137–170.Google Scholar
[6] Maaloe, E. (1973) Approximation formulae for estimation of waiting-time in multiple-channel queueing systems. Management Sci. 19, 703–710.CrossRefGoogle Scholar
[7] Newell, G. (1970) Approximate stochastic behavior of n-server service systems with large n. Lecture Notes in Economic and Mathematical Systems 87, ed. Beckmann, M., Goos, G. and Kunzi, H. P. Springer-Verlag, Berlin.Google Scholar
[8] Stidham, S. (1968) Static decision models for queueing systems with non-linear waiting costs. Technical Report No. 9, Stanford University.Google Scholar
[9] Takács, L. (1969) On Erlang's formula. Ann. Math. Statist. 40, 71–78.Google Scholar