SCHEDULING JOBS WITH EXPONENTIAL PROCESSING AND ARRIVAL TIMES ON IDENTICAL PROCESSORS SO AS TO MINIMIZE THE EXPECTED MAKESPAN

被引：18

作者：

VANDERHEYDEN, L ^{[1
]}

机构：

[1] HARVARD UNIV,CAMBRIDGE,MA 02138

来源：

关键词：

D O I：

10.1287/moor.6.2.305

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：305 / 312

页数：8

共 11 条

[1]

BRUNO JP, UNPUBLISHED

[2] CONTRACTION MAPPINGS IN THEORY UNDERLYING DYNAMIC PROGRAMMING [J].

DENARDO, EV .

[3]

FREDERICKSON GN, 1979, TRCSL7901 U CAL DEP

[4]

Howard RonaldA., 1960, DYNAMIC PROGRAMMING

[5] Markoff Chains as an Aid in the Study of Markoff Processes [J].

Jensen, Arne .

SKANDINAVISK AKTUARIETIDSKRIFT, 1953, 36 (1-2) :87-91

LIPPMAN, SA .

[7]

Rothkopf M., 1966, MANAGE SCI, V12, P627, DOI DOI 10.1287/MNSC.12.9.707

[8] NEGATIVE DYNAMIC PROGRAMMING [J].

STRAUCH, RE .

ANNALS OF MATHEMATICAL STATISTICS, 1966, 37 (04) :871-&

[9]

WEISS G, 1978, COMMUNICATION

[10] EMBEDDED RENEWAL PROCESSES IN GI/G/S QUEUE [J].

WHITT, W .