摘要
这篇论文学习 M 的短暂离开过程[x ] 有单身的服务者假期的 /G/1 排队系统。我们在场导出从任何起始的状态发生在有限时间间隔的离开的期望的数字的一个简单概率分解方法；期望的数字的 asymptotic 扩大。特别，我们为一些特殊情况导出一些更实际的结果。
This paper studies the transient departure process of M^x/G/1 queueing system with single server vacation. We present a simple probability decomposition method to derive the expected number of departures occurring in finite time interval from any initial state and the asymptotic expansion of the expected number. Especially, we derive some more practical results for some special cases.
基金
This research is supported by Natural Science Foundation of the Education Department of Sichuan Province （[2006]A067） and the Talent Introduction Foundation of Sichuan Normal University. Acknowledgments The author thanks referees for their many helpful comments and suggestions for the improvement of this paper.
关键词
渐近展开
期望数值
簇聚集
数学模型
Asymptotic expansion, expected number, group arrival, server vacation.
