Domination analysis for scheduling on non preemptive uniformly related machines | Eisner | DMTCS Proceedings

DMTCS Proceedings, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)

Domination analysis for scheduling on non preemptive uniformly related machines

Idan Eisner, Alek Vainshtein

Abstract

Full Text: PostScript PDF