Discrete Time Geo/G/1 Queue with Multiple Adaptive Vacations

被引：0
作者：
Zhe George Zhang
Naishuo Tian
机构：
[1] Western Washington University,Department of Finance, Marketing and Decision Sciences, College of Business and Economics
[2] Simon Fraser University,Faculty of Business Administration
[3] Yanshan University,Department of Mathematics and Physics
来源：
Queueing Systems | 2001年 / 38卷
关键词：
discrete-time queueing system; vacation; stochastic decomposition; busy period;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper treats the discrete time Geometric/G/1 system with vacations. In this system, after serving all customers in the system, the server will take a random maximum number of vacations before returning to the service mode. The stochastic decomposition property of steady-state queue length and waiting time has been proven. The busy period, vacation mode period, and service mode period distributions are also derived. Several common vacation policies are special cases of the vacation policy presented in this study.
引用
收藏
页码：419 / 429
页数：10
相关论文
共 17 条
[1]  
Bharath-Kumar K.(1980)Discrete time queueing systems and their networks IEEE Trans. Commun 28 260-263
[2]  
Cooper R.B.(1970)Queues served in cyclic order Waiting times, Bell Systems Techn. J 49 399-413
[3]  
Doshi B.T.(1986)Queueing systems with vacations–a survey Queueing Systems 1 29-66
[4]  
Fuhrmann S.W.(1985)Stochastic decomposition in the M/G/1 queue with generalized vacations Oper. Res 33 1117-1129
[5]  
Cooper R.B.(1989)The threshold policy inM Naval Res. Logist 36 111-123
[6]  
Kella O.(1977)G IEEE Trans. Commun 25 1-29
[7]  
Kobayaski H.(1975)1 queue with vacations Managm. Sci 22 202-211
[8]  
Konheim A.G.(1958)Queueing models for computer communication analysis Oper. Res 6 96-105
[9]  
Levy Y.(1990)Utilization of idle time in an M Oper. Res. Commun 1 17-30
[10]  
Yachiali U.(1998)G INFOR 36 193-204
12