AGBADOGBE, J. S. I.; THRON, C. . Quasi-Optimal Low-Complexity Algorithms for the Permutation Flowshop Problem with Weighted Tardiness Penalties. International Journal of Machine Intelligence and Computing, [S. l.], v. 3, n. 1, p. 46–89, 2026. DOI: 10.51200/ijmic.v3i1.7574. Disponível em: https://jurcon.ums.edu.my/ojums/index.php/IJMIC/article/view/7574. Acesso em: 12 sep. 2026.