THE 2-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH TOTAL TARDINESS

被引:42
作者
SEN, T [1 ]
DILEEPAN, P [1 ]
GUPTA, JND [1 ]
机构
[1] BALL STATE UNIV,DEPT MANAGEMENT SCI,MUNCIE,IN 47306
关键词
10;
D O I
10.1016/0305-0548(89)90005-1
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
引用
收藏
页码:333 / 340
页数:8
相关论文
共 10 条
[1]   ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS [J].
EMMONS, H .
OPERATIONS RESEARCH, 1969, 17 (04) :701-&
[2]  
FISHER ML, 1971, MATH PROGRAM, V11, P229
[3]  
Garey M. R., 1979, COMPUTERS INTRACTABI
[4]  
Grabowski J., 1980, Opsearch, V17, P133
[5]  
Johnson S.M., 1954, NAV RES LOGIST Q, V1, P61, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]
[6]  
LAWLER EL, 1981, MATH OPER RES, V6, P153, DOI 10.1287/moor.6.1.153
[7]  
Lenstra J., 1977, ANN DISCRETE MATH, V1, P343, DOI [10.1016/S0167-5060(08)70743-X, DOI 10.1016/S0167-5060(08)70743-X, /10.1016/S0167-5060(08)70743-X]
[8]  
POTTS CN, 1982, OPNS RES LETT, V1, P177
[9]   DYNAMIC-PROGRAMMING SOLUTION OF SEQUENCING PROBLEMS WITH PRECEDENCE CONSTRAINTS [J].
SCHRAGE, L ;
BAKER, KR .
OPERATIONS RESEARCH, 1978, 26 (03) :444-449
[10]   SEQUENCING N JOBS ON M MACHINES TO MINIMIZE MAXIMUM TARDINESS - A BRANCH-AND-BOUND SOLUTION [J].
TOWNSEND, W .
MANAGEMENT SCIENCE, 1977, 23 (09) :1016-1019