J. Ding, S. Song, J. N. Gupta, R. Zhang, R. Chiong 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

R. Ruiz and T. Stützle, 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

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