T. Aldowaisan and A. Allahverdi, New heuristics for no-wait flowshops to minimize makespan, Computers & Operations Research, vol.30, issue.8, pp.1219-1231, 2003.
DOI : 10.1016/S0305-0548(02)00068-0

E. Bertolissi, Heuristic algorithm for scheduling in the no-wait flow-shop, Journal of Materials Processing Technology, vol.107, issue.1-3, pp.459-465, 2000.
DOI : 10.1016/S0924-0136(00)00720-2

L. Bianco, P. Dell-'olmo, and S. Giordani, Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates, INFOR: Information Systems and Operational Research, vol.37, issue.1, pp.3-19, 1999.
DOI : 10.1080/03155986.1999.11732365

J. Ding, S. Song, N. D. Jatinder, R. Gupta, R. Zhang et al., An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem, Applied Soft Computing, vol.30, pp.604-613, 2015.
DOI : 10.1016/j.asoc.2015.02.006

J. Grabowski and J. Pempera, Some local search algorithms for no-wait flow-shop problem with makespan criterion, Computers & Operations Research, vol.32, issue.8, pp.2197-2212, 2005.
DOI : 10.1016/j.cor.2004.02.009

N. Mladenovi´cmladenovi´c and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, pp.1097-1100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2

M. Nawaz, I. Emory-enscore, and . Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, vol.11, issue.1, pp.91-95, 1983.
DOI : 10.1016/0305-0483(83)90088-9

M. F. Quan-ke-pan, Y. Tasgetiren, and . Liang, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem, Computers & Operations Research, vol.35, issue.9, pp.2807-2839, 2008.

L. Quan-ke-pan, M. F. Wang, B. Tasgetiren, and . Zhao, A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion, The International Journal of Advanced Manufacturing Technology, vol.38, pp.3-4337, 2007.

B. Qian, L. Wang, R. Hu, D. X. Huang, and X. Wang, A DE-based approach to no-wait flow-shop scheduling, Computers & Industrial Engineering, vol.57, issue.3, pp.787-805, 2009.
DOI : 10.1016/j.cie.2009.02.006

C. Rajendran, A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan, Journal of the Operational Research Society, vol.45, issue.4, pp.472-478, 1994.
DOI : 10.1057/jors.1994.65

H. Röck, The Three-Machine No-Wait Flow Shop is NP-Complete, Journal of the ACM, vol.31, issue.2, pp.336-345, 1984.
DOI : 10.1145/62.65

R. Ruiz and T. Sttzle, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, vol.177, issue.3, pp.2033-2049, 2007.
DOI : 10.1016/j.ejor.2005.12.009

H. Samarghandi and T. Y. Elmekkawy, A meta-heuristic approach for solving the no-wait flow-shop problem, International Journal of Production Research, vol.48, issue.4, pp.7313-7326, 2012.
DOI : 10.1080/00207540802555744

T. Schiavinotto and T. Stützle, A review of metrics on permutations for search landscape analysis, Computers & Operations Research, vol.34, issue.10, pp.3143-3153, 2007.
DOI : 10.1016/j.cor.2005.11.022

E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, issue.2, pp.278-285, 1993.
DOI : 10.1016/0377-2217(93)90182-M
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8802