[1]
“Minimizing Total Completion Time, Total Earliness Time, and Maximum Tardiness for a Single Machine scheduling problem”, IHJPAS, vol. 37, no. 1, pp. 386–402, Jan. 2024, doi: 10.30526/37.1.3094.