SCHEDULING NETWORK FLOWSHOPS SO AS TO MINIMIZE MAKESPAN

被引:16
作者
KURIYAN, K
REKLAITIS, GV
机构
关键词
D O I
10.1016/0098-1354(89)89017-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
引用
收藏
页码:187 / 200
页数:14
相关论文
共 24 条
[1]  
[Anonymous], 1969, SIAM J APPL MATH
[2]  
Baker K., 1974, INTRO SEQUENCING SCH
[3]  
Campbell H. G., 1970, MANAGE SCI, V16, P630
[4]  
COFFMAN EG, 1978, SIAM J COMPUT, V7, P1, DOI 10.1137/0207001
[5]   EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS [J].
DANNENBRING, DG .
MANAGEMENT SCIENCE, 1977, 23 (11) :1174-1182
[6]  
ELMAGHRABY SH, 1980, AIIE T, V12
[7]  
Garey MR., 1979, COMPUTERS INTRACTABI
[8]  
Graham R. L., 1979, Discrete Optimisation, P287
[9]   BOUNDS FOR CERTAIN MULTIPROCESSING ANOMALIES [J].
GRAHAM, RL .
BELL SYSTEM TECHNICAL JOURNAL, 1966, 45 (09) :1563-+
[10]  
Johnson SM, 1954, NAV RES LOGIST Q, V1, P61, DOI DOI 10.1002/NAV.3800010110