The Finite Capacity GI/M/1 Queue with Server Vacations
研究了当队列为空时服务器休假（休假时间服从指数分布）的有限容量排队系统，给出了到达时刻和随机时刻的队列长度分布，并提出了计算阻塞概率的启发式算法。
We consider the GI/M/1/K queue where the server takes exponentially distributed vacations when there are no customers left to serve in the queue. We obtain the queue length distribution at arrival epochs and random epochs for the multiple vacation case. We present heuristic algorithms to compute the blocking probability for this system. Several numerical examples are presented to analyze the behaviour of the blocking probability and to test the performance of the heuristics.