[1]
M. Neamah , N. and 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 (Mar. 2026), 52–61. DOI:https://doi.org/10.53851/psijk.v3.i9.52-61.