Preemptive scheduling on uniformly related machines:...

Journal of Scheduling 2017 / 4 Vol. 20; Iss. 2

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

Epstein, Leah, Yatsiv, Ido
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
20
Language:
english
Journal:
Journal of Scheduling
DOI:
10.1007/s10951-016-0476-y
Date:
April, 2017
File:
PDF, 999 KB
english, 2017
Conversion to is in progress
Conversion to is failed