期刊文献+

MATCHED QUEUEING SYSTEM M·PH/G/1

MATCHED QUEUEING SYSTEM M·PH/G/1
原文传递
导出
摘要 In this paper,we study the matched queueing system,MoPH/G/1,where the type-Ⅰ input is a Poisson process,the type-Ⅱ input is a PH renewal process, and the service times are i.i.d. random variables. A necessary and sufficient condition for the stationariness of the system is given.The expectations of the length of the non-idle period and the number of customers served in a non-idle period are obtained. In this paper,we study the matched queueing system,MoPH/G/1,where the type-Ⅰ input is a Poisson process,the type-Ⅱ input is a PH renewal process, and the service times are i.i.d. random variables. A necessary and sufficient condition for the stationariness of the system is given.The expectations of the length of the non-idle period and the number of customers served in a non-idle period are obtained.
出处 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1993年第2期104-114,共11页 应用数学学报(英文版)
基金 This project is supported by the National Natural Science Foundation of China partially by the Institute of Mathematics, Academia Sinica
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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