Joseph Y.-T. Leung, Chung-Lun Li, “Scheduling with processing set restrictions: A survey”, International Journal of Production Economics, 116, № 2, 2008, 251
YUMEI HUO, JOSEPH Y.-T. LEUNG, XIN WANG, “PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION”, Int. J. Found. Comput. Sci., 20, № 06, 2009, 1147
Evgeny Shchepin, Nodari Vakhania, “An absolute approximation algorithm for scheduling unrelated machines”, Naval Research Logistics, 53, № 6, 2006, 502
Olga Kuryatnikova, Juan C. Vera, “New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines”, Theory Comput Syst, 64, № 2, 2020, 199
Dvir Shabtay, Shlomo Karhi, “Online scheduling of two job types on a set of multipurpose machines with unit processing times”, Computers & Operations Research, 39, № 2, 2012, 405
Jinwen Ou, Xueling Zhong, Xiangtong Qi, “Scheduling parallel machines with inclusive processing set restrictions and job rejection”, Naval Research Logistics, 63, № 8, 2016, 667
Nirwan Ansari, Jingjing Zhang, Media Access Control and Resource Allocation, 2013, 67
Safia Kedad-Sidhoum, Florence Monna, Grégory Mounié, Denis Trystram, “A Family of Scheduling Algorithms for Hybrid Parallel Platforms”, Int. J. Found. Comput. Sci., 29, № 01, 2018, 63
Daniel Page, Roberto Solis-Oba, “A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights”, Algorithms, 9, № 2, 2016, 38
Koushik Sinha, Atish Datta Chowdhury, Subhas Kumar Ghosh, Satyajit Banerjee, 5408, Distributed Computing and Networking, 2008, 450