APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS

被引:3
作者
NUMATA, K [1 ]
机构
[1] UNIV ELECTROCOMMUN,DEPT COMP SCI & INFORMAT MATH,CHOFU,TOKYO 182,JAPAN
关键词
D O I
10.15807/jorsj.31.61
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:61 / 81
页数:21
相关论文
共 10 条
[1]   SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].
BRUNO, J ;
COFFMAN, EG ;
SETHI, R .
COMMUNICATIONS OF THE ACM, 1974, 17 (07) :382-387
[2]  
COFFMAN EG, 1978, SIAM J COMPUT, V7, P1, DOI 10.1137/0207001
[3]  
DEVIS E, 1981, J ACM, V28, P721
[4]  
Garey MR., 1979, COMPUTERS INTRACTABI
[5]   BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J].
GRAHAM, RL .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) :416-&
[6]   EXACT AND APPROXIMATE ALGORITHMS FOR SCHEDULING NONIDENTICAL PROCESSORS [J].
HOROWITZ, E ;
SAHNI, S .
JOURNAL OF THE ACM, 1976, 23 (02) :317-327
[7]   HEURISTIC ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON NONIDENTICAL PROCESSORS [J].
IBARRA, OH ;
KIM, CE .
JOURNAL OF THE ACM, 1977, 24 (02) :280-289
[8]   ON SCHEDULING INDEPENDENT TASKS WITH RESTRICTED EXECUTION TIMES [J].
LEUNG, JYT .
OPERATIONS RESEARCH, 1982, 30 (01) :163-171
[9]  
NUMATA K, 1984 P FALL C OP RES, P77
[10]   ANALYSIS OF A LINEAR-PROGRAMMING HEURISTIC FOR SCHEDULING UNRELATED PARALLEL MACHINES [J].
POTTS, CN .
DISCRETE APPLIED MATHEMATICS, 1985, 10 (02) :155-164