The following publications are possibly variants of this publication:
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machinesLeah Epstein, Hanan Zebedat-Haider. scheduling, 17(1):87-93, 2014. [doi]
- Optimal non-preemptive semi-online scheduling on two related machinesLeah Epstein, Lene M. Favrholdt. jal, 57(1):49-73, 2005. [doi]
- Optimal preemptive semi-online scheduling to minimize makespan on two related machinesLeah Epstein, Lene M. Favrholdt. orl, 30(4):269-275, 2002. [doi]
- Parallel solutions for preemptive makespan scheduling on two identical machinesLeah Epstein. scheduling, 26(1):61-76, February 2023. [doi]
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion timesLeah Epstein, Ido Yatsiv. scheduling, 20(2):115-127, 2017. [doi]
- An optimal online algorithm for scheduling with general machine cost functionsIslam Akaria, Leah Epstein. scheduling, 23(2):155-162, 2020. [doi]