期刊文献+

服务中断渐近可忽略的G/M/n/m+M模型的高负荷极限 被引量:1

Heavy-traffic Limits for G/M/n/m + M Queueing Models with Symptotically Negligible Service Interruptions
下载PDF
导出
摘要 为更切合实际,本文将G/M/n+M队列扩展到有限等待空间,在等待空间有限的情况下考虑服务中断对队列系统的影响.假设服务中断是渐近可忽略的,应用鞅和连续映射定理,得到了队长过程的FCLT,其极限是有跳跃的随机积分方程的分段唯一解.结果表明服务中断的影响是由刻画队长过程极限的跳跃来体现的,即在等待空间有限的情况下也能得到类似结论. For the practical purpose, this paper extends G/M/n+M queue to the finite-capacity case and discusses the service interruptions’ effect to the queuing system when the capacity is finite. Assuming that the service interruptions are asymptotically negligible, by applying the martingale and continuous mapping theorem, we obtain the FCLT for the queue-length process, where the limit is characterized as the pathwise unique solution to a stochastic integral equation with jumps. The results indicate that the effects of service interruptions are reflected by the jumps which scaled the queue-length process limits, in other words, we can derive the similar conclusions in the finite-capacity case.
机构地区 长安大学理学院
出处 《工程数学学报》 CSCD 北大核心 2014年第2期207-214,共8页 Chinese Journal of Engineering Mathematics
基金 中央高校基本科研业务费专项资金(CHD2012TD015)~~
关键词 有限等待空间 服务中断 泛函中心极限定理(FCLT) finite-capacity service interruptions functional central limit theorem (FCLT)
  • 相关文献

参考文献7

  • 1Pang G, Whitt W. Heavy-traffic limits for many-server queues with service interruptions[J]. Queueing Systems, 2009, 61(2-3): 167-202.
  • 2Kella O, Whitt W. Diffusion approximations for queues with server vacations[J]. Advances in Applied Probability, 1990, 22(2): 706-729.
  • 3Whitt W. Stochastic-Process Limits[M]. New York: Springer-Verlag, 2002.
  • 4Halfin S, Whitt W. Heavy-traffic limits for queues with many exponential servers[J]. Operations Research, 1981, 29(3): 567-588.
  • 5Garnett O, Mandelbaum A, Reiman M I. Designing a call center with impatient customers[J]. Manufac- turing &: Service Operations Management, 2002, 4(3): 208-227.
  • 6Billingsley P. Convergence of Probability Measures[M]. New York: John Wiley & Sons, 1999.
  • 7Whitt W. Martingale proofs of many-server heavy-traffic limits for Markovian queues[J]. Probability Survey, 2007, (4): 193-267.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部