[1]
I. Hamdi and T. Loukil, “Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness”, Int. Journal of COP and Infor., vol. 5, no. 2, pp. 47–57, Apr. 2014.