For online job assignment with heterogeneous rewards and durations, Forward-Looking BALANCE achieves an asymptotically optimal competitive ratio of ln(RD)+3lnln(R∨D)+O(1), and no online algorithm can beat ln(RD)+Ω(1).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Online Job Assignment
For online job assignment with heterogeneous rewards and durations, Forward-Looking BALANCE achieves an asymptotically optimal competitive ratio of ln(RD)+3lnln(R∨D)+O(1), and no online algorithm can beat ln(RD)+Ω(1).