On the NP-hardness of two scheduling problems under linear constraints.

Recommended citation: Nip K. On the NP-hardness of two scheduling problems under linear constraints. In: M. Li et al. (Eds.): IJTCS-FAW 2023, Lecture Notes in Computer Science, vol. 13933, pp. 58–70, 2023