1.
Minimizing Total Completion Time, Total Earliness Time, and Maximum Tardiness for a Single Machine scheduling problem. IHJPAS [Internet]. 2024 Jan. 20 [cited 2024 May 17];37(1):386-402. Available from: https://jih.uobaghdad.edu.iq/index.php/j/article/view/3094