On the NP-Hardness of Two Scheduling Problems Under Linear Constraints

Kameng Nip. On the NP-Hardness of Two Scheduling Problems Under Linear Constraints. In Minming Li, Xiaoming Sun 0001, Xiaowei Wu 0001, editors, Frontiers of Algorithmics - 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023, Proceedings. Volume 13933 of Lecture Notes in Computer Science, pages 58-70, Springer, 2023. [doi]

Abstract

Abstract is missing.