HAMDI, I.; LOUKIL, T. Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness. International Journal of Combinatorial Optimization Problems and Informatics, [S. l.], v. 5, n. 2, p. 47–57, 2014. Disponível em: https://ijcopi.org/ojs/article/view/84. Acesso em: 25 apr. 2024.