Minimizing Total Completion Time, Total Earliness Time, and Maximum Tardiness for a Single Machine scheduling problem. Ibn AL-Haitham Journal For Pure and Applied Sciences, [S. l.], v. 37, n. 1, p. 386–402, 2024. DOI: 10.30526/37.1.3094. Disponível em: https://jih.uobaghdad.edu.iq/index.php/j/article/view/3094.. Acesso em: 17 may. 2024.