The queue length of GI/G/1 queueing system with server setup times
This paper deals with the GI/G/1 queueing system with a random setup time. The server is turned off each time when the syetem becomes empty. At this point of time the idle period starts. As soon as a customer arrives, the setup of the service facility begins which is needed before starting each busy period. In this paper we study the transient distribution of queue length by applying the Markov skeleton process approach. We show that the transient distribution of queue length is the minimal nonnegative solution and also the unique bounded solution to a nonnegative linear eqution.
GI/G/1 queue setup time Markov skeleton process Queue length Transient distribution
Qinggui Zhao Xuan Zhang Xiangxing Kong Qinggui Zhao
Institute of Probability & Statistics Central South University, CSU Changsha, 410075,China School of Mathematics and Statistics Chongqing University of Arts and Sciences, CUAS Chongqing, 4021
国际会议
长沙
英文
3681-3683
2009-10-10(万方平台首次上网日期,不代表论文的发表时间)