SCHEDULING TO MAXIMIZE THE MINIMUM PROCESSOR FINISH TIME IN A MULTIPROCESSOR SYSTEM

被引:85
作者
DEUERMEYER, BL
FRIESEN, DK
LANGSTON, MA
机构
[1] TEXAS A&M UNIV,DEPT IND SCI,DIV COMP SCI,COLLEGE STN,TX 77843
[2] WASHINGTON STATE UNIV,DEPT COMP SCI,PULLMAN,WA 99164
来源
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1982年 / 3卷 / 02期
关键词
D O I
10.1137/0603019
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:190 / 196
页数:7
相关论文
共 7 条
[1]  
COFFMAN EG, 1978, SIAM J COMPUT, V7, P1, DOI 10.1137/0207001
[2]  
Conway R, 1967, THEORY SCHEDULING
[3]   ANALYSIS OF GREEDY SOLUTIONS FOR A REPLACEMENT PART SEQUENCING PROBLEM [J].
FRIESEN, DK ;
DEUERMEYER, BL .
MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (01) :74-87
[4]  
Garey Michael R., 1979, COMPUTERS INTRACTABI
[5]   BOUNDS ON MULTIPROCESSING TIMING ANOMALIES [J].
GRAHAM, RL .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (02) :416-&
[6]   FLEET SIZING AND ALLOCATION PROBLEM [J].
PARIKH, SC .
MANAGEMENT SCIENCE, 1977, 23 (09) :972-977
[7]  
[No title captured]