SEQUENCING TASKS WITH EXPONENTIAL SERVICE TIMES TO MINIMIZE THE EXPECTED FLOW TIME OR MAKESPAN

被引：65

作者：

BRUNO, J

DOWNEY, P

FREDERICKSON, GN

机构：

[1] UNIV ARIZONA,TUCSON,AZ 85721

[2] PENN STATE UNIV,UNIVERSITY PK,PA 16802

来源：

关键词：

D O I：

10.1145/322234.322242

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：100 / 113

页数：14

共 8 条

[1]

Coffman E.G., 1976, COMPUTER JOB SHOP SC

[2]

Conway R, 1967, THEORY SCHEDULING

[3] BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J].

GRAHAM, RL .

[4]

Karp R. M., 1972, COMPLEXITY COMPUTER

[5] SCHEDULING WITH DEADLINES AND LOSS FUNCTIONS [J].

MCNAUGHTON, R .

[6]

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

[7]

Smith W.E., 1956, NAV RES LOGIST Q, V3, P59, DOI DOI 10.1002/NAV.3800030106

[8]

WEBER RR, 1979, THESIS QUEENS COLLEG