Minimizing maximum (weighted) flow-time on related and unrelated machines

international colloquium on automata, languages and programming, Volume 77.0, Issue 2, 2015, Pages 515-536.

Cited by: 16|Views19
EI

Abstract:

We initiate the study of job scheduling on related and unrelated machines so as to minimize the maximum flow time or the maximum weighted flow time (when each job has an associated weight). Previous work for these metrics considered only the setting of parallel machines, while previous work for scheduling on unrelated machines only consid...More

Code:

Data:

Your rating :
0

 

Tags
Comments