Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-05T09:25:55.993Z Has data issue: false hasContentIssue false
  • English
  • Français

M/G/1 queueing systems with returning customers

Published online by Cambridge University Press:  14 July 2016

Betsy S. Greenberg
Betsy S. Greenberg*
Affiliation:
The University of Texas at Austin
*
∗Postal address: Department of Management Science and Information Systems, CBA 5.202, The University of Texas at Austin, TX 78712-1175, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

Single-channel queues with Poisson arrivals, general service distributions, and no queue capacity are studied. A customer who finds the server busy either leaves the system for ever or may return to try again after an exponentially distributed time. Steady-state probabilities are approximated and bounded in two different ways. We characterize the service distribution by its Laplace transform, and use this characterization to determine the better method of approximation.

Keywords

GEOMETRIC ORBITSRETRIAL QUEUESLAPLACE TRANSFORM METHODS
Type
Research Papers
Information
Journal of Applied Probability , Volume 26 , Issue 1 , March 1989 , pp. 152 - 163
Copyright
Copyright © Applied Probability Trust 1989 

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

Aleksandrov, A. M. (1974) A queueing system with repeated orders. Engineering Cybernetics 12(3), 1–3.Google Scholar
Cohen, J. W. (1957) Basic problems of telephone traffic theory and the influence of repeated calls. Philips Telecommunication Rev. 18, 49–100.Google Scholar
Greenberg, B. S. and Wolff, R. W. (1987) An upper bound on the performance of queues with returning customers. J. Appl. Prob. 24, 466–475.Google Scholar
Keilson, J., Cozzolino, J. and Young, H. (1968) A service system with unfilled requests repeated. Operat. Res. 16, 1126–1137.Google Scholar
Le Gall, P. (1976) Trafics généraux de télécommunications sans attente. Commutation et Electronique 55, 5–24.Google Scholar
Lubacz, J. and Roberts, J. (1984) A new approach to the single server repeat attempt system with balking. Proc. 3rd Intern. Seminar Teletraffic Theory , 290–293.Google Scholar
Sauer, C. H., Macnair, E. A. and Kurose, J. F. (1982) The Research Queueing Package, Version 2; CMS Users Guide. IBM Research Report RA 139 (#41127).Google Scholar
Stoyan, D. (1983) Comparison Methods for Queues and Other Stochastic Models , ed. Daley, Daryl J., Wiley, New York.Google Scholar