A proportional mechanism with payments achieves a tight 3/2 approximation to the optimal makespan in unrelated-machines scheduling, and achieves the exact optimum for normalized costs.
Aslam, April Rasala, Clifford Stein, and Neal E
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Proportionally Fair Makespan Approximation
A proportional mechanism with payments achieves a tight 3/2 approximation to the optimal makespan in unrelated-machines scheduling, and achieves the exact optimum for normalized costs.