← 研踪 PaperTrailarXiv:2611.21184 · v1
An Optimal Online Algorithm for Single-machine Scheduling with Two Agents
首次提交 2026-11-16 22:40
版本更新 2026-11-16 22:40
雷达观测 2026-11-17 17:11
摘要
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 , for a given priority weight . 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 , we propose novel online algorithm which achieves a competitive ratio of . This result matches the theoretical lower bound.
作者备注:24 pages, 6 figure. Comments and suggestions are most welcome
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-16 22:40 · 最新观测版本
An Optimal Online Algorithm for Single-machine Scheduling with Two Agents
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 , for a given priority weight . 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 , we propose novel online algorithm which achieves a competitive ratio of . This result matches the theoretical lower bound.
查看此版本解读 →查看此版本原文 ↗