SCHEDULING JOBS WITH STOCHASTICALLY ORDERED PROCESSING TIMES ON PARALLEL MACHINES TO MINIMIZE EXPECTED FLOWTIME

被引:51
作者
WEBER, RR
VARAIYA, P
WALRAND, J
机构
[1] UNIV CALIF BERKELEY,ELECTR RES LAB,BERKELEY,CA 94720
[2] UNIV CAMBRIDGE,DIV MANAGEMENT SYST,CAMBRIDGE CB2 1RX,ENGLAND
[3] UNIV CALIF BERKELEY,DEPT ELECT ENGN & COMP SCI,BERKELEY,CA 94720
关键词
D O I
10.2307/3214023
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
引用
收藏
页码:841 / 847
页数:7
相关论文
共 5 条
[1]  
Conway R, 1967, THEORY SCHEDULING
[2]   SCHEDULING TASKS WITH EXPONENTIAL SERVICE TIMES ON PARALLEL PROCESSORS [J].
GLAZEBROOK, KD .
JOURNAL OF APPLIED PROBABILITY, 1979, 16 (03) :685-689
[3]   SCHEDULING JOBS WITH STOCHASTIC PROCESSING REQUIREMENTS ON PARALLEL MACHINES TO MINIMIZE MAKESPAN OR FLOWTIME [J].
WEBER, RR .
JOURNAL OF APPLIED PROBABILITY, 1982, 19 (01) :167-182
[4]  
WEBER RR, 1980, THESIS CAMBRIDGE U
[5]   SCHEDULING TASKS WITH EXPONENTIAL SERVICE TIMES ON NON-IDENTICAL PROCESSORS TO MINIMIZE VARIOUS COST-FUNCTIONS [J].
WEISS, G ;
PINEDO, M .
JOURNAL OF APPLIED PROBABILITY, 1980, 17 (01) :187-202