M. Neamah , N., & Jabbar Khraibet , T. (2026). Minimize Total Completion Time, Total Number of Tardy Jobs, and the Range of Lateness for Single Machine Scheduling problems. Pure Sciences International Journal of Kerbala, 3(9), 52–61. https://doi.org/10.53851/psijk.v3.i9.52-61