摘要
本文讨论了多个工作站、每站有两个队列排队等待服务的循环移动服务系统,其服务规则是按照每个队列的化先权进行批量服务的。在系统平稳的情况下,导出了服务员到站后各队列顾客数的起始概率、终了概率的递推算法以及相应队长的计算公式。
In this paper, a class cyclic service system is studied. In the system,there are mulitistations and two queues in each station. The service is a batch according to the priority of each queue. In the steady state, the recursive algorithm of the starting probabilities, the finishing probabilities and the queue length are deduced.
出处
《兰州铁道学院学报》
1992年第1期1-6,共6页
Journal of Lanzhou Railway University
关键词
优先排队
平稳过程
队长
排队论
priority queues, stationary process, queue length
