Jan Clemens Gehrke, Klaus Jansen, Stefan E. J. Kraft, Jakob Schikowski, “A PTAS for Scheduling Unrelated Machines of Few Different Types”, Int. J. Found. Comput. Sci., 29, no. 04, 2018, 591
Hans Raj Tiwary, Victor Verdugo, Andreas Wiese, “On the extension complexity of scheduling polytopes”, Operations Research Letters, 48, no. 4, 2020, 472
Nirwan Ansari, Jingjing Zhang, Media Access Control and Resource Allocation, 2013, 75
Hanna Furmańczyk, Tytus Pikies, Inka Sokołowska, Krzysztof Turowski, “Approximation algorithms for job scheduling with block-type conflict graphs”, Computers & Operations Research, 166, 2024, 106606
Klaus Jansen, Kati Land, Marten Maack, “Estimating the Makespan of the Two-Valued Restricted Assignment Problem”, Algorithmica, 80, no. 4, 2018, 1357
Raphael Bleuse, Safia Kedad‐Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram, “Scheduling independent tasks on multi‐cores with GPU accelerators”, Concurrency and Computation, 27, no. 6, 2015, 1625
Shan Wang, Huiqiao Su, Guohua Wan, “Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling”, J Comb Optim, 30, no. 4, 2015, 982
Zichuan Xu, Yuexin Fu, Qiufen Xia, Hao Li, IEEE INFOCOM 2023 - IEEE Conference on Computer Communications, 2023, 1
Luis Fanjul-Peyro, Rubén Ruiz, “Size-reduction heuristics for the unrelated parallel machines scheduling problem”, Computers & Operations Research, 38, no. 1, 2011, 301
Kilian Grage, Klaus Jansen, Kim-Manuel Klein, The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019, 135