FLOWSHOP SCHEDULING WITH DOMINANT MACHINES

被引:47
作者
HO, JC [1 ]
GUPTA, JND [1 ]
机构
[1] BALL STATE UNIV,DEPT MANAGEMENT,MUNCIE,IN 47306
关键词
D O I
10.1016/0305-0548(94)E0007-T
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper examines two special cases of the n-job, m-machine permutation scheduling flowshop problem. The first case assumes an increasing series of dominating machines; while the second case assumes a decreasing series of dominating machines. Efficient solution procedures for finding the optimal permutation schedules for various performance measures, including maximum flowtime, mean flowtime, mean completion time of machines, the number of tardy jobs, maximum lateness, and maximum tardiness, are developed.
引用
收藏
页码:237 / 246
页数:10
相关论文
共 19 条
[1]   FLOWSHOP NO-IDLE OR NO-WAIT SCHEDULING TO MINIMIZE THE SUM OF COMPLETION TIMES [J].
ADIRI, I ;
POHORYLES, D .
NAVAL RESEARCH LOGISTICS, 1982, 29 (03) :495-504
[2]  
Bagga P.C., 1969, J CANADIAN OPERATION, V7, P152
[3]  
Baker K., 1974, INTRO SEQUENCING SCH
[4]  
Conway R, 1967, THEORY SCHEDULING
[5]  
Garey MR., 1979, COMPUTERS INTRACTABI
[6]   OPTIMAL SCHEDULES FOR SPECIAL STRUCTURE FLOWSHOPS [J].
GUPTA, JND .
NAVAL RESEARCH LOGISTICS, 1975, 22 (02) :255-269
[7]  
GUPTA JND, 1971, J OPER RES SOC JPN, V13, P169
[8]  
GUPTA JND, 1979, DISAGGREGATION PROBL, P363
[9]  
GUPTA JND, 1977, UNPUB OPTIMAL SCHEDU
[10]  
JACKSON JR, 1955, 43 U CAL RES REP