Technical Note - A Single-Server Queue with Service Times Depending on the Order of Services
暂无分享,去创建一个
This note deals with a GI/G/1 queuing system with service times depending on the order of services in each busy period. We derive a sufficient condition under which the length of the first busy period starting with an arbitrary initial state is almost surely finite.
[1] R. Ash,et al. Real analysis and probability , 1975 .
[2] Peter D. Welch,et al. On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service , 1964 .