SCHEDULING UNIT-TIME JOBS ON PROCESSORS WITH DIFFERENT CAPABILITIES

被引：6

作者：

CHEN, YL

CHIN, YH

机构：

来源：

COMPUTERS & OPERATIONS RESEARCH | 1989年 / 16卷 / 05期

关键词：

D O I：

10.1016/0305-0548(89)90029-4

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

页码：409 / 417

页数：9

共 14 条

[1] MINIMIZING MEAN WEIGHTED EXECUTION TIME LOSS ON IDENTICAL AND UNIFORM PROCESSORS [J].

BLAZEWICZ, J ;

FINKE, G .

INFORMATION PROCESSING LETTERS, 1987, 24 (04) :259-263

[2] ON A SCHEDULING PROBLEM WHERE A JOB CAN BE EXECUTED ONLY BY A LIMITED NUMBER OF PROCESSORS [J].

CHANG, RS ;

LEE, RCT .

COMPUTERS & OPERATIONS RESEARCH, 1988, 15 (05) :471-478

[3]

CHEN YL, 1989, THSIS NATIONAL TSING

[4] ALGORITHMS FOR SCHEDULING TASKS ON UNRELATED PROCESSORS [J].

DAVIS, E ;

JAFFE, JM .

JOURNAL OF THE ACM, 1981, 28 (04) :721-736

[5] SCHEDULING TO MINIMIZE MAXIMUM LATENESS ON UNEQUAL PARALLEL PROCESSORS [J].

DE, P ;

MORTON, TE .

COMPUTERS & OPERATIONS RESEARCH, 1982, 9 (03) :221-232

[6]

Even S., 1975, SIAM Journal on Computing, V4, P507, DOI 10.1137/0204043

[7]

GONZALEZ MJ, 1977, COMPUT SURV, V9, P173, DOI 10.1145/356698.356700

[8]

GONZALEZ T, IN PRESS J ACM

[9]

GRAHAM RL, 1977, DISCRETE MATH, V5, P287

[10] FAST ALGORITHMS FOR BIPARTITE NETWORK FLOW [J].

GUSFIELD, D ;

MARTEL, C ;

FERNANDEZBACA, D .

SIAM JOURNAL ON COMPUTING, 1987, 16 (02) :237-251

← 1 2 →