Nirwan Ansari, Jingjing Zhang, Media Access Control and Resource Allocation, 2013, 29
Guy Baram, Tami Tamir, “Reoptimization of the minimum total flow-time scheduling problem”, Sustainable Computing: Informatics and Systems, 4, № 4, 2014, 241
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, “Computing Nash Equilibria for Scheduling on Restricted Parallel Links”, Theory Comput Syst, 47, № 2, 2010, 405
Nirwan Ansari, Jingjing Zhang, Media Access Control and Resource Allocation, 2013, 1
Sergey Sevastyanov, 1661, Mathematical Optimization Theory and Operations Research: Recent Trends, 2022, 3
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo, “Scheduling jobs with equal processing times subject to machine eligibility constraints”, J Sched, 14, № 1, 2011, 27
Jia Xu, Zhao-Hui Liu, “An Optimal Online Algorithm for Scheduling on Two Parallel Machines with GoS Eligibility Constraints”, J. Oper. Res. Soc. China, 4, № 3, 2016, 371
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo, “Makespan minimization in online scheduling with machine eligibility”, Ann Oper Res, 204, № 1, 2013, 189
Péter Biró, Eric McDermid, “Matching with sizes (or scheduling with processing set restrictions)”, Discrete Applied Mathematics, 164, 2014, 61
Joseph Y-T. Leung, C.T. Ng, “Fast approximation algorithms for uniform machine scheduling with processing set restrictions”, European Journal of Operational Research, 260, № 2, 2017, 507