A TIME-SHARING QUEUE WITH A FINITE NUMBER OF CUSTOMERS

被引：17

作者：

ADIRI, I

AVIITZHA.B

机构：

[1] Technion-Israel Institute of Technology, Department of Industrial and Management Engineering, Technion City, Haifa, Israel

来源：

JOURNAL OF THE ACM | 1969年 / 16卷 / 02期

关键词：

D O I：

10.1145/321510.321523

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A time-sharing queue serving a finite number of customers is described. It is assumed that both the service time and the time elapsing between termination of service and the next arrival of the same customer at the queue (service station) are exponential. The model was studied by Krishnamoorthi and Wood, but their results are not in complete agreement with the results of this paper. In addition, some new results are presented in terms of steady-state expectations. © 1969, ACM. All rights reserved.

引用

页码：315 / &

共 8 条

[1]

ADIRI I, 5 OP RES STAT EC MIM

[2]

COFFMAN EG, 1964, SP1719 SYST DEV CORP

[3]

Khinchin A, 1933, MAT SBORNIK, V40, P119

[4] TIME-SHARED COMPUTER OPERATIONS WITH BOTH INTERARRIVAL AND SERVICE TIMES EXPONENTIAL [J].

KRISHNAM.B ;

WOOD, RC .

JOURNAL OF THE ACM, 1966, 13 (03) :317-&

[5]

KRISHNAMOORTHI B, 1966, OPSEARCH J OPER RES, V3, P101

[6] On time losses in machinery undergoing interruptions II [J].

Kronig, R ;

Mondria, H .

PHYSICA, 1943, 10 :331-336

[7] On time losses in machinery undergoing interruptions [J].

Kronig, R .

PHYSICA, 1943, 10 :215-224

[8]

TAKACS L, 1957, THEORY PROBABILITY A, V11, P90

← 1 →