OPTIMAL ORDER OF SERVERS FOR TANDEM QUEUES IN LIGHT TRAFFIC

被引：11

作者：

GREENBERG, BS ^{[1
]}

WOLFF, RW ^{[1
]}

机构：

[1] UNIV CALIF BERKELEY,DEPT IND ENGN & OPERAT RES,BERKELEY,CA 94720

来源：

关键词：

D O I：

10.1287/mnsc.34.4.500

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：500 / 508

页数：9

共 10 条

[1] REDUCTION METHODS FOR TANDEM QUEUING SYSTEMS [J].

FRIEDMAN, HD .

[2]

GREENBERG BS, 1986, THESIS U CALIFORNIA

[3]

LETHONEN T, 1986, J APPL PROBAB, V23, P115

[4] MINIMIZING THE EXPECTED MAKESPAN IN STOCHASTIC FLOW SHOPS [J].

PINEDO, M .

[5]

Pinedo M, 1982, APPLIED PROBABILITY, VII, P307

[6]

STOYAN D, 1983, COMP METHODS QUEUES

[7]

Tembe S.V., 1974, OPER RES, V24, P824

[8] INTERCHANGEABILITY OF [M]1 QUEUES IN SERIES [J].

WEBER, RR .

[9] THE BEST ORDER FOR QUEUES IN SERIES [J].

WHITT, W .

[10] TANDEM QUEUES WITH DEPENDENT SERVICE TIMES IN LIGHT TRAFFIC [J].

WOLFF, RW .