Abstract
We consider the M/Mij/1 queue as a model of queues with changeover times, i.e., the service is exponential with parameterμ ij depending on the previous job type (i) and the current job type (j). It is shown that the departure process is renewal and Poisson iffμ ij =μ (constant). In this case, types of departures are dependent renewal processes. Crosscovariance and crosscorrelations are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.J. Burke, The output of a queueing system, Oper. Res. 4 (1956) 699–704.
J.A. Buzacott and D. Gupta, Impact of flexible machines on automated manufacturing systems, In:Proc. second ORSA/TIMS conf. on FMS: operations research models and applications, eds. K.E. Stecke and R. Suri (Elsevier, New York, 1986).
E. Çinlar, Time dependence of queues with semi-Markovian service times, J. Appl. Probab. 4 (1967) 356–364.
E. Çinlar, Markov renewal theory, Adv. in Appl. Probab. 1 (1969) 123–187.
E. Çinlar,Introduction to Stochastic Process (Prentice Hall, Englewood Cliffs, NJ, 1975).
J.H.A. de Smit, The single server semi-Markov queue, Memo #517, Department of Applied Mathematics, Twente University of Technology, Enschede, The Netherlands, 1985.
J.H.A. de Smit and G.I.K. Regterschot, A semi-Markov queue with exponential service times. In:Proc. Int. Symp. on semi-Markov processes, ed. J. Janssen (Plenum Press, NY, 1985).
R.L. Disney and P.C. Kiessler,Traffic Processes in Queueing Networks: A Markov Renewal Approach (The John Hopkins Univ. Press, Baltimore, MD, 1987).
D. Gupta and J.A. Buzacott, Effect of setup times and rework on the performance of two-job-class flexible manufacturing systems, ORSA/TIMS Conf. on Analysis and Control of Large Scale Stochastic Systems, Chapel Hill, N.C., May, 1988.
J.J. Hunter,Mathematical Techniques of Applied Probability, Vol. 2 (Academic Press, NY, 1983).
M.N. Magalhães, Queues with a Markov renewal service process, Doctoral dissertation, Department of Industrial Engineering and Operations Research, Virginia Polytechnique Institute and State University, Blacksburg, VA, 1988.
D.C. McNickle, The number of departures from a semi-Markov queue, J. Appl. Probab. 11 (1974) 825–828.
M.F. Neuts, The single server queue with Poisson input and semi-Markov service times, J. Appl. Probab. 3 (1966) 202–230.
M.F. Neuts, Some explicit formulas for the steady-state behavior of the queue with semi-Markov service times, Adv. in Appl. Probab. 9 (1977) 141–157.
M.F. Neuts, The M/G/1 queue with several types of customers and changeover times, Adv. in Appl. Probab. 9 (1977) 604–644.
V. Ramaswami, A stable recursion for the steady state vector in Markov chains of M/G/1 type, Commun. Statist.-Stochastic Models 4 (1988) 183–188.
B. Simon and R.L. Disney, Markov renewal processes and renewal processes: Some conditions for equivalence, New Zealand Oper. Res. 12 (1984) 19–29.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Magalhães, M.N., Disney, R.L. Departures from queues with changeover times. Queueing Syst 5, 295–311 (1989). https://doi.org/10.1007/BF01225321
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01225321