Reddi S S, Ramamoorthy C V. On the flowshop sequencing problems with no wait in process[J]. Oper Res Q, 1972(23): 323-331.
[2]
Baker K R, Scudder G D. Sequencing with earliness and tardiness penalties: a review[J]. Operations Research, 1990, 38(1): 22.
[3]
Ning Weiwei, Yan Guangrong, Zhong Huawei, et al. A Heuristic algorithm for the earliness and tardiness penalties scheduling problem in permutation flow shop[J]. Modular Machine Tool and Automatic Manufacturing Technique, 2009(10): 102-106, 112.
[4]
Nawaz M, Jr Enscore E, Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem[J]. Omega, 1983, 11(1): 91-95.
[5]
Ruiz R, Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics[J]. European Journal of Operational Research, 2005, 165(2): 479-494.
[6]
Reza Hejazi S, Saghafian S. Flowshop-scheduling problems with makespan criterion: a review[J]. International Journal of Production Research, 2005(43): 2895-2929.
[7]
Framinan J M, Leisten R, Rajendran C. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem[J]. International Journal of Production Research, 2003(41): 121-148.
