Rossi A，Lanzetta M.Scheduling flow lines with buffers by ant colony digraph［J］.Expert System with Applications，2013(40):3328/3340.
[2]
Ying K C，Gupta J N D，Lin S W，et al.Permutation and nonpermutation schedules for the flowline manufacturing cell with sequence dependent family setups［J］.International Journal of Production Research，2010，48(8):2169/2184.
[3]
Liao L M，Huang C J.Tabu search for nonpermutation flowshop scheduling problem with minimizing total tardiness［J］.Applied Mathematics & Computation，2010，217(2):557/567.
[4]
Lin S W，Ying K C.Applying a hybrid simulated annealing and tabu search approach to nonpermutation flowshop scheduling problems［J］.International Journal of Production Research，2009，47(5):1411/1424.
[5]
Liao C J，Liao L M，Tseng C T.A performance evaluation of permutation vs nonpermutation schedules in a flowshop［J］.International Journal of Production Research，2006，44(20):4297/4309.
[6]
Ying K C.Solving nonpermutation flowshop scheduling problems by an effective iterated greedy heuristic［J］.International Journal of Advanced Manufacturing Technology，2008，38(3/4):348/354.
[7]
Ying K C，Lin S W.Multiheuristic desirability ant colony system heuristic for nonpermutation flowshop scheduling problems［J］.International Journal of Advanced Manufacturing Technology，2007，33(7/8):793/802.
[8]
Mehravaran Y，Logendran R.Nonpermutation flowshop scheduling in a supply chain with sequencedependent setup times［J］.International Journal of Production Economics，2012，135(2):953/963.
