The finite capacity GI/M/1 queue with server vacations

被引：8

作者：

Karaesmen, F ^{[1
]}

Gupta, SM ^{[1
]}

机构：

[1] NORTHEASTERN UNIV,DEPT MECH IND & MFG ENGN,SNELL ENGN CTR 334,BOSTON,MA 02115

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1996年 / 47卷 / 06期

关键词：

queueing; stochastic processes;

D O I：

10.1057/jors.1996.101

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：817 / 828

页数：12

共 17 条

[1] APPROXIMATING A POINT PROCESS BY A RENEWAL PROCESS .2. SUPERPOSITION ARRIVAL PROCESSES TO QUEUES [J].