Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
Crossref DOI link: https://doi.org/10.1007/s10951-016-0476-y
Published Online: 2016-04-06
Published Print: 2017-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Epstein, Leah
Yatsiv, Ido
Text and Data Mining valid from 2016-04-06