Leah Epstein, Ido Yatsiv. Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times. J. Scheduling, 20(2):115-127, 2017. [doi]
@article{EpsteinY17,
title = {Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times},
author = {Leah Epstein and Ido Yatsiv},
year = {2017},
doi = {10.1007/s10951-016-0476-y},
url = {http://dx.doi.org/10.1007/s10951-016-0476-y},
researchr = {https://researchr.org/publication/EpsteinY17},
cites = {0},
citedby = {0},
journal = {J. Scheduling},
volume = {20},
number = {2},
pages = {115-127},
}