Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times

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]

Authors

Leah Epstein

This author has not been identified. Look up 'Leah Epstein' in Google

Ido Yatsiv

This author has not been identified. Look up 'Ido Yatsiv' in Google