JOB SCHEDULING TO MINIMIZE EXPECTED WEIGHTED FLOWTIME ON UNIFORM PROCESSORS

被引:14
作者
RIGHTER, R [1 ]
机构
[1] UNIV SANTA CLARA,LEAVEY SCH BUSINESS & ADM,DEPT DECIS & INFORMAT SCI,SANTA CLARA,CA 95053
关键词
D O I
10.1016/0167-6911(88)90009-6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
14
引用
收藏
页码:211 / 216
页数:6
相关论文
共 14 条
[1]  
AGRAWALA AK, 1984, IEEE T COMPUT, V33, P351, DOI 10.1109/TC.1984.1676440
[2]   2 COMPETING QUEUES WITH LINEAR COSTS AND GEOMETRIC SERVICE REQUIREMENTS - THE MU-C-RULE IS OFTEN OPTIMAL [J].
BARAS, JS ;
DORSEY, AJ ;
MAKOWSKI, AM .
ADVANCES IN APPLIED PROBABILITY, 1985, 17 (01) :186-209
[3]   THE C-MU RULE REVISITED [J].
BUYUKKOC, C ;
VARAIYA, P ;
WALRAND, J .
ADVANCES IN APPLIED PROBABILITY, 1985, 17 (01) :237-238
[4]   MINIMIZING EXPECTED MAKESPANS ON UNIFORM PROCESSOR SYSTEMS [J].
COFFMAN, EG ;
FLATTO, L ;
GAREY, MR ;
WEBER, RR .
ADVANCES IN APPLIED PROBABILITY, 1987, 19 (01) :177-201
[5]  
Cox D.R., 1961, QUEUES
[6]   SEQUENTIAL STOCHASTIC ASSIGNMENT PROBLEM [J].
DERMAN, C ;
LIEBERMA.GJ ;
ROSS, SM .
MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (07) :349-355
[7]  
Hardy G., 1952, INEQUALITIES
[8]   INDIVIDUALLY OPTIMAL ROUTING IN PARALLEL SYSTEMS [J].
KUMAR, PR ;
WALRAND, J .
JOURNAL OF APPLIED PROBABILITY, 1985, 22 (04) :989-995
[9]  
LIN WE, 1984, IEEE T AUTOMAT CONTR, V29, P696, DOI 10.1109/TAC.1984.1103637
[10]  
PINEDO M, 1982, DETERMINISTIC STOCHA, P181