Upper and lower bounds for the waiting time in the symmetric shortest queue system

被引：27

作者：

Adan, Ivo ^{[1
]}

van Houtum, Geert-Jan ^{[1
]}

van der Wal, Jan ^{[1
]}

机构：

[1] Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands

来源：

ANNALS OF OPERATIONS RESEARCH | 1994年 / 48卷 / 02期

关键词：

D O I：

10.1007/BF02024665

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper we compare the exponential symmetric shortest queue system with two related systems: the shortest queue system with Threshold Jockeying and the shortest queue system with Threshold Blocking. The latter two systems are easier to analyse and are shown to give tight lower and upper bounds respectively for the mean waiting time in the shortest queue system. The approach also gives bounds for the distribution of the total number of jobs in the system.

引用

页码：197 / 217

页数：21

共 29 条

[1]

ADAN IJB, 1990, STOCH MODELS, V6, P691

[2] MATRIX-GEOMETRIC ANALYSIS OF THE SHORTEST QUEUE PROBLEM WITH THRESHOLD JOCKEYING [J].