Yumei Huo, Joseph Y.-T. Leung, “Fast approximation algorithms for job scheduling with processing set restrictions”, Theoretical Computer Science, 411, № 44-46, 2010, 3947
Mihai Burcea, Wing-Kai Hon, Hsiang-Hsuan Liu, Prudence W. H. Wong, David K. Y. Yau, “Scheduling for electricity cost in a smart grid”, J Sched, 19, № 6, 2016, 687
E. V. Shchepin, “On the complexity of constructing multiprocessor little-preemptive schedules”, Proc. Steklov Inst. Math., 290, № 1, 2015, 166
Yumei Huo, Joseph Y.-T. Leung, “Parallel machine scheduling with nested processing set restrictions”, European Journal of Operational Research, 204, № 2, 2010, 229
José Verschae, Andreas Wiese, “On the configuration-LP for scheduling on unrelated machines”, J Sched, 17, № 4, 2014, 371
Leah Epstein, Asaf Levin, “Scheduling with processing set restrictions: PTAS results for several variants”, International Journal of Production Economics, 133, № 2, 2011, 586
Lin Chen, Wenchang Luo, Guochuan Zhang, 6681, Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011, 244
Nirwan Ansari, Jingjing Zhang, Media Access Control and Resource Allocation, 2013, 11
Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo, “Makespan minimization in online scheduling with machine eligibility”, 4OR-Q J Oper Res, 8, № 4, 2010, 331
Olivier Beaumont, Lionel Eyraud-Dubois, Suraj Kumar, 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2017, 768