The single-server queue with uniformly limited actual waiting times

The single-server queue with uniformly limited actual waiting times
复制标题

DOI:
10.1080/02331938108842755
复制
发表时间:
1981
期刊:
影响因子:
2.2
通讯作者:
D. Minh
D. Minh
中科院分区:
数学3区
文献类型:
--
作者:
D. Minh

文献摘要

被引文献

相似文献

本文研究了一个单服务台排队系统,其中顾客的等待时间不超过常数K。如果等待时间大于K,则必须缩短前一个客户的服务时间。利用分析方法,结合顾客到达时系统开始忙碌期,排队过程按概率“重新开始”的性质,得到了系统的各种瞬态解和稳态解.
This paper studies a single-server queueing system in which no customer has to wait for a duration longer than a constant K. If the waiting time is longer than K, then the service time of the previous customer will have to be cut short. Using analytical method together with the property that the queueing process ‘starts anew’ probabilistically whenever an arriving customer initiates a busy period, we obtain various transient and stationary solutions for the system.