An Optimal Online Algorithm for Single-machine Scheduling with Two Agents
Peihai Liu, Kejun Zhao, Xiwen Lu
原文摘要
This paper addresses the online two-agent scheduling problem on a single machine, where jobs arrive over time. The objective is to minimize the weighted sum of the agents' makespans, denoted as $C_{\max}^A + θC_{\max}^B$, for a given priority weight $θ\ge 1$. A significant gap has persisted between the established theoretical lower bound on the competitive ratio and the performance of the best-known online algorithms. For the parameter range $1 \leq θ\leq \tfrac{1+\sqrt{5}}{2}$, we propose novel online algorithm which achieves a competitive ratio of $1+\tfracθ{1+θ}$. This result matches the theoretical lower bound.
cs.DS · cs.DM