4Garey M R, Johnson D S, Sethi R. The complexity of flowshop and jobshop scheduling [ J ]. Mathematics of Operations Research, 1976,1 ( 2 ) : 117 - 129.
5Kalczynski P J, Kamburowski J. On the NEH heuristic for minimizing the makespan in permutation flow shops [J]. Omega, 2007,35( 1 ) :53 -60.
6Framinan J M, Leisten R,Rajendran C. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idle time or flowtime in the static permutation flowshop sequencing problem [ J ]. International Journal of production Research, 2003, 41 ( 1 ) : 121 - 148.
7Framinan J M, Leisten R. An efficient constructive heuristic for flowtime minimisation in permutation flow shops[J]. Omega, 2003, 31(4) :311 -317.
8Woo H S, Yim D S. A heuristic algorithm for mean flowtime objective in flowshop scheduling[ J ]. Computers &Operations Research, 1998, 25(3) :175 -182.
9Rajendran C, Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs [ J ]. European Journal of Operational Research, 1997, 103( 1 ) : 129 - 138.
10Allahverdi A, Aldowaisan T. New heuristics to minimize total completion in m-machine flowshops [ J ]. International Journal of Production Economics, 2002, 77 (1): 71 -83.
