[2] KIIT Univ, Sch Comp Applicat, Bhubaneswar 751024, Orissa, India
来源:
TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS
|
2014年
/
4卷
/
02期
关键词:
Single working vacation;
vacation interruption;
cost;
queue;
genetic algorithm;
D O I:
暂无
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
This paper presents a renewal input single working vacation queue with change over time and Bernoulli schedule vacation interruption under (a, c, b) policy. The service and vacation times are exponentially distributed. The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a <= c <= b). The change over period follows if there are (a - 1) customers at service completion instants. The steady state queue length distributions at arbitrary and pre-arrival epochs are obtained. An optimal cost policy is presented along with few numerical experiences. The genetic algorithm and quadratic fit search method are employed to search for optimal values of some important parameters of the system.
机构:
Cent S Univ, Sch Math, Changsha 410075, Hunan, Peoples R China
Shandong Univ Technol, Sch Sci, Zibo 255049, Peoples R ChinaCent S Univ, Sch Math, Changsha 410075, Hunan, Peoples R China
Tao, Li
Wang, Zhizhong
论文数: 0引用数: 0
h-index: 0
机构:
Cent S Univ, Sch Math, Changsha 410075, Hunan, Peoples R ChinaCent S Univ, Sch Math, Changsha 410075, Hunan, Peoples R China
Wang, Zhizhong
Liu, Zaiming
论文数: 0引用数: 0
h-index: 0
机构:
Cent S Univ, Sch Math, Changsha 410075, Hunan, Peoples R ChinaCent S Univ, Sch Math, Changsha 410075, Hunan, Peoples R China