Optimization of the Modified T Vacation Policy for a Discrete-Time Geom[X]/G/1 Queueing System with Startup

被引：0
|
作者：
Lin, Xian-Wei [1 ]
Chen, Yan [2 ]
Wei, Cai-Min [1 ,3 ]
Fan, Zhun [3 ]
机构：
[1] Shantou Univ, Dept Math, Shantou 515063, Peoples R China
[2] Shantou Polytech, Dept Nat Sci, Shantou 515078, Peoples R China
[3] Shantou Univ, Guangdong Prov Key Lab Digital Signal & Image Pro, Shantou 515063, Peoples R China
来源：
FUZZY INFORMATION AND ENGINEERING AND DECISION | 2018年 / 646卷
基金：
中国国家自然科学基金;
关键词：
Queueing system model; Startup time; Stochastic decomposition; Modified T vacations policy; Embedded markov chain method; SERVER;
D O I：
10.1007/978-3-319-66514-6_41
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we discuss a discrete-time Geom([X])/G/1 queueing system with modified T vacation policy and startup time. We derive the generating functions and the mean values for the steady state system size and the waiting time, and also get those of the busy period, the vacation period and the vacation cycle by using embedded Markov chain. Finally, we determine the optimal ( T*, J*) to minimize the cost function with fixed cost elements by constructing a cost function.
引用
收藏
页码：414 / 424
页数：11
相关论文
共 50 条
12345