The following publications are possibly variants of this publication:
- Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel MachinesLeah Epstein, Jiri Sgall. algorithmica, 39(1):43-57, 2004. [doi]
- Optimal and online preemptive scheduling on uniformly related machinesTomás Ebenlendr, Jiri Sgall. scheduling, 12(5):517-527, 2009. [doi]
- Parallel solutions for preemptive makespan scheduling on two identical machinesLeah Epstein. scheduling, 26(1):61-76, February 2023. [doi]
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machinesLeah Epstein, Hanan Zebedat-Haider. scheduling, 17(1):87-93, 2014. [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]