Analysis of multi-server queues with station and server vacations

Abstract In this paper, we consider GI / M / c queues with two classes of vacation mechanisms: Station vacation and server vacation. In the first one, all the servers take vacation simultaneously whenever the system becomes empty, and they also return to the system at the same time, i.e., station vacation is a group vacation for all servers. This phenomenon occurs in practice, for example, when the system consists of a set of machines monitored by a single operator, or the system consists of inseparable interconnected parallel machines. In such situations the whole station has to be treated as a single entity for vacation when the system is utilized for a secondary task. For the second class of vacation mechanisms, each server takes its own vacation whenever it complexes a service and finds no customers waiting in the queue, which occurs, for instance in the post office, when each server is a relatively independent working unit, and can itself be used for other purposes. For both models, we derive steady state probabilities that have matrix geometric form, and develop computational algorithms to obtain numerical solutions. We also analyze and make comparisons of these models based on numerical observations.

[1]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[2]  Jacques Teghem,et al.  Control of the service process in a queueing system , 1986 .

[3]  B. Conolly.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .

[4]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[5]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[6]  Winfried K. Grassmann,et al.  Computation of Steady-State Probabilities for Infinite-State Markov Chains with Repeating Rows , 1993, INFORMS J. Comput..

[7]  Winfried K. Grassmann,et al.  Equilibrium distribution of block-structured Markov chains with repeating rows , 1990, Journal of Applied Probability.

[8]  Douglas R. Miller.  Matrix-geometric solutions in stochastic models: An algorithmic approach, by Marcel R. Neuts, The Johns Hopkins University Press, Baltimore, 1981, 352 pp. Price: $32.50 , 1983, Networks.

[9]  G. Latouche.  ALGORITHMS FOR INFINITE MARKOV CHAINS WITH REPEATING COLUMNS , 1993 .

[10]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[11]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[12]  Paul J. Schweitzer,et al.  Stochastic Models, an Algorithmic Approach , by Henk C. Tijms (Chichester: Wiley, 1994), 375 pages, paperback. , 1996, Probability in the Engineering and Informational Sciences.

[13]  Chengxuan Cao,et al.  The GI/M/1 queue with exponential vacations , 1989, Queueing Syst. Theory Appl..

[14]  Robert J. Plemmons,et al.  Linear algebra, Markov chains, and queueing models , 1993 .

[15]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .