Burkhard Monien, Andreas Woclaw, 4007, Experimental Algorithms, 2006, 195
Jia Xu, Zhaohui Liu, “Online scheduling with equal processing times and machine eligibility constraints”, Theoretical Computer Science, 572, 2015, 58
Ola Svensson, Proceedings of the forty-third annual ACM symposium on Theory of computing, 2011, 617
Esra Koca, E. Alper Yıldırım, “A hierarchical solution approach for a multicommodity distribution problem under a special cost structure”, Computers & Operations Research, 39, no. 11, 2012, 2612
Evgeny V. Shchepin, Nodari Vakhania, “On the geometry, preemptions and complexity of multiprocessor and shop scheduling”, Ann Oper Res, 159, no. 1, 2008, 183
Gyorgy Dosa, Hans Kellerer, Zsolt Tuza, “Restricted assignment scheduling with resource constraints”, Theoretical Computer Science, 760, 2019, 72
Daniel R. Page, Roberto Solis-Oba, “Makespan minimization on unrelated parallel machines with a few bags”, Theoretical Computer Science, 821, 2020, 34
Alan J. Soper, Vitaly A. Strusevich, “Preemptive and non-preemptive scheduling on two unrelated parallel machines”, J Sched, 25, no. 6, 2022, 659
Daniel R. Page, Roberto Solis-Oba, Marten Maack, 11346, Combinatorial Optimization and Applications, 2018, 341
Nirwan Ansari, Jingjing Zhang, Media Access Control and Resource Allocation, 2013, 87