1. Chen, Z.L., Qing, L., Guochun, T.: Single machine scheduling with discretely controllable processing times. Oper. Res. Lett. 21(2), 69–76 (1997)
2. Cheng, T.C.E., Chen, Z.L., Li, C.L., Lin, B.M.T.: Scheduling to minimize the total compression and late costs. Nav. Res. Logist. 45(1), 67–82 (1998)
3. Ehrgott, M.: Multicriteria Optimization, vol. 491. Springer, New York (2005)
4. Fontan, F., Lemaire, P., Brauner, N.: Scheduling problems with processing time dependent profit: applications and a nice polynomial case. PMS 2021-17th International Workshop on Project Management and Scheduling (2021)
5. Lawler, E.L.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annal. Oper. Res. 26(1–4), 125–133 (1991)