期刊文献+

空竭服务多级适应性休假Geom^X/G(Geom/G)/1可修排队系统 被引量:2

Geom^X/G(Geom/G)/1 repairable queue with exhaustive service discipline and adaptive multistage vacations
下载PDF
导出
摘要 在空竭服务多级适应性休假GeomX/G/1排队的基础上,讨论了空竭服务多级适应性休假GeomX/G(Geom/G)/1可修排队系统.利用嵌入马尔可夫链法,得到了稳态状态下顾客离去时刻系统队长的母函数,说明系统队长存在随机分解;此外,对系统的一个忙循环进行分析,使用Wald定理和离散时间更新报酬定理得到了系统的稳态可用度. Based on the Geom^X/G/1 queueing system with exhaustive service discipline and adaptive multistage vacations, the Geom^X/G(Geom/G)/1 repairable queueing system with exhaustive service discipline and adaptive multistage vacations are considered. By means of imbedded Markov chains, in the steady state, the PGF of the system size is obtained. It shows that the system size can be decomposed into two random variables. The stable availability of the system is also provided.
机构地区 江苏大学理学院
出处 《江苏大学学报(自然科学版)》 EI CAS 北大核心 2005年第4期316-319,共4页 Journal of Jiangsu University:Natural Science Edition
基金 江苏省自然科学基金资助项目(BK97047) 江苏省教育厅基金资助项目(00KJT110003)
关键词 排队论 Geom^x/G(Geom/G)/1型排队系统 多级适应性休假 马尔可夫链 可用度 queuing theory Geom^X/G(Geom/G)/1 queue adaptive multistage vacations Markov chains availability
  • 相关文献

参考文献8

二级参考文献18

  • 1田乃硕.多级适应性服务的离散时间单台排队[J].数学的实践与认识,1989,19(3):48-54. 被引量:5
  • 2[3]Hideaki Takagi. Queueing Analysis[M]. Amsterdam North-Holland, 1991.
  • 3[4]Wortman M, Disney R. Vocation queues with Markov schedules[J]. Adv. Appl. Pob. 1990, (22):730-748.
  • 4[2]Kin K Leung.On the addition delay in an M/G/1 queue with generalizd vocation and exhaustive service[J].Opns Res,1992,40:873-879.
  • 5[3]Fuhrman S W,Cooper R B.Stochastic decomposition in the M/G/1 queue with generalized vocation[J].Opns Res,1985,33:1117-1129.
  • 6[4]Shathikumar G J.On stochastic decomposition in M/G/1 queue with server vocation[J].Opns Res,1988,36:566-569.
  • 7[5]Boxma O J,Groenendijk W P.Pseudo-conservation law sincyclic-service system[J].J Appl Prob,1987,24:949-964.
  • 8[6]Doshi B T.Condition and unconditional distribution for M/G/1 type queue with server vocation[J].Queue Syst,1990,7:229-252.
  • 9[7]Neuts M F,Ramalhoto M F.A service model in which the server is required to search for customers[J].J Appl Prob,1984,21:157-166.
  • 10[8]Takagi H.Queueing analysis of polling models[J].ACM Computing Survey,1988,20:1-28.

共引文献23

同被引文献30

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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