Hostname: page-component-7479d7b7d-wxhwt Total loading time: 0 Render date: 2024-07-13T19:20:43.894Z Has data issue: false hasContentIssue false
  • English
  • Français

The M/G/1 queue with several types of customers and change-over times

Published online by Cambridge University Press:  01 July 2016

Marcel F. Neuts
Marcel F. Neuts*
Affiliation:
University of Delaware
Get access Rights & Permissions [Opens in a new window]

Abstract

We study an M/G/1 queue with m types of customer, operating under the first-come, first-served discipline. It is assumed that the server expends a random length of time in change-over from one type of customer to another. Various priority rules have been proposed to reduce the amount of time spent in change-over. These queue disciplines generally require a separate monitoring, whose cost is frequently non-negligible. As a basis for evaluating the merits of alternate queue disciplines, it is important to have information on the M/G/1 queue with m customer types when service is first-come, first-served. By appealing to general methods for the M/SM/1 queue, a large number of detailed and explicit results are obtained. In addition, algorithmic solutions are given for the steady-state distributions which are analytically intractable.

Keywords

QUEUES: M/G/1SEVERAL CUSTOMER TYPESSEMI-MARKOV PROCESSCOMPUTATIONAL PROBABILITYQUEUE LENGTHWAITING TIME
Type
Research Article
Information
Advances in Applied Probability , Volume 9 , Issue 3 , September 1977 , pp. 604 - 644
Copyright
Copyright © Applied Probability Trust 1977 

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] Çinlar, E. (1967) Time dependence of queues with semi-Markovian service times. J. Appl. Prob. 4, 356–364.CrossRefGoogle Scholar
[2] Çinlar, E. (1969) Markov renewal theory. Adv. Appl. Prob. 1, 123–187.Google Scholar
[3] Gaver, D. P. Jr. (1963) A comparison of queue disciplines when service orientation times occur. Nav. Res. Logist. Quart. 10, 219–235.Google Scholar
[4] Hunter, J. J. (1969) On the moments of Markov renewal processes. Adv. Appl. Prob. 1, 188–210.Google Scholar
[5] Kemeny, J. and Snell, J. L. (1960) Finite Markov Chains. Van Nostrand, Princeton, NJ.Google Scholar
[6] Marcus, M. and Minc, H. (1964) A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Boston.Google Scholar
[7] Neuts, M. F. (1966) The single server queue with Poisson input and semi-Markov service times. J. Appl. Prob. 3, 202–230.CrossRefGoogle Scholar
[8] Neuts, M. F. (1974) The Markov renewal branching process. In Proc. Conf. Math. Meth. in Theory of Queues 1973, Kalamazoo MI, Springer-Verlag, New York, 1–21.Google Scholar
[9] Neuts, M. F. (1975) Computational problems related to the Galton–Watson process. Purdue Mimeo Series No. 402, Department of Statistics, Purdue University, W. Lafayette, IN, 47907, U.S.A. Google Scholar
[10] Neuts, M. F. (1975) Computational uses of the method of phases in the theory of queues. Computers Math. Appl. 1, 151–166.CrossRefGoogle Scholar
[11] Neuts, M. F. (1975) Probability distributions of phase type. In Liber Amicorum Prof. Dr. H. Florin, Catholic University of Louvain, Heverlee, Belgium, 173–206.Google Scholar
[12] Neuts, M. F. (1975) Algorithms for the waiting time distributions under various queue disciplines in the M/G/1 queue with service time distribution of phase type. TIMS–North Holland Studies in Management Science, No. 7.Google Scholar
[13] Neuts, M. F. (1976) Moment formulas for the Markov renewal branching process. Adv. Appl. Prob. 8, 690–711.CrossRefGoogle Scholar
[14] Neuts, M. F. (1977) Some explicit formulas for the steady-state behavior of the queue with semi-Markovian service times. Adv. Appl. Prob. 9, 141–157.CrossRefGoogle Scholar