MINIMIZING MEAN FLOW-TIME WITH PARALLEL PROCESSORS AND RESOURCE CONSTRAINTS

被引：20
作者：
BLAZEWICZ, J
KUBIAK, W
ROCK, H
SZWARCFITER, J
机构：
[1] TECH UNIV BERLIN,INST QUANTITAT METHODEN,D-1000 BERLIN 12,FED REP GER
[2] UNIV FED RIO DE JANEIRO,RIO DE JANEIRO,RJ,BRAZIL
[3] GDANSK TECH UNIV,INST INFORMAT,PL-80952 GDANSK,POLAND
来源：
ACTA INFORMATICA | 1987年 / 24卷 / 05期
关键词：
D O I：
10.1007/BF00263292
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
21
引用
收藏
页码：513 / 524
页数：12
相关论文
共 21 条
[1]   SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY [J].
BLAZEWICZ, J ;
LENSTRA, JK ;
KAN, AHGR .
DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :11-24
[2]  
BLAZEWICZ J, 1983, OPER RES LETT, V2, P80, DOI 10.1016/0167-6377(83)90042-1
[3]   DEADLINE SCHEDULING OF TASKS WITH READY TIMES AND RESOURCE CONSTRAINTS [J].
BLAZEWICZ, J .
INFORMATION PROCESSING LETTERS, 1979, 8 (02) :60-63
[4]   SCHEDULING TASKS ON 2 PROCESSORS WITH DEADLINES AND ADDITIONAL RESOURCES [J].
BLAZEWICZ, J ;
BARCELO, J ;
KUBIAK, W ;
ROCK, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 26 (03) :364-370
[5]  
BLAZEWICZ J, 1986, IEEE T COMPUT, V35, P389
[6]  
BLAZEWICZ J, 1979, METHODS OPER RES, V35, P67
[7]   SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].
BRUNO, J ;
COFFMAN, EG ;
SETHI, R .
COMMUNICATIONS OF THE ACM, 1974, 17 (07) :382-387
[8]  
BRUNO JL, 1976, COMPUTER JOB SHOP SC
[9]   PREEMPTIVE SCHEDULING, LINEAR-PROGRAMMING AND NETWORK FLOWS [J].
DEWERRA, D .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (01) :11-20
[10]  
Garey M. R., 1975, SIAM Journal on Computing, V4, P397, DOI 10.1137/0204035
123