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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.