Abstract
We considerG/M/1 queues with multiple vacation discipline, where at the end of every busy period the server stays idle in the system for a period of time called changeover time and then follows a vacation if there is no arrival during the changeover time. The vacation time has a hyperexponential distribution. By using the methods of the shift operator and supplementary variable, we explicitly obtain the queue length probabilities at arrival time points and arbitrary time points simultaneously.
Similar content being viewed by others
References
B.D. Choi and D.H. Han,G/M a,b /1 queue with server vacations, J. of Oper. Res. in Japan37 (1994), 171–181.
B.T. Doshi,Queueing systems with vacation — a survey, Queueing Systems1 (1986), 29–66.
D. Gross and C.M. Harris,Fundamental of Queueing Theory, John Wiley & Sons, 1985.
H. Li and Y. Zhu,Analysis of M/G/1 queues with delayed vacations and exhaustive service discipline, European J. of Oper. Res.92 (1996), 125–134.
H. Takagi,Queueing Analysis: A Foundation of Performance Evaluation, Vol 1: Vacation and Priority Systems, Part 1, North-Holland, 1991.
J.H. Wilkinson,The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, 1965.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Han, D.H., Choi, D.I. G/M/1 queues with delayed vacations. Korean J. Comput. & Appl. Math. 5, 1–11 (1998). https://doi.org/10.1007/BF03008931
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03008931