跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

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 Cmax⁡A+θCmax⁡BC_{\max}^A + θC_{\max}^B, for a given priority weight θ≥1θ\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≤θ≤1+521 \leq θ\leq \tfrac{1+\sqrt{5}}{2}, we propose novel online algorithm which achieves a competitive ratio of 1+θ1+θ1+\tfracθ{1+θ}. This result matches the theoretical lower bound.

作者备注:24 pages, 6 figure. Comments and suggestions are most welcome

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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 Cmax⁡A+θCmax⁡BC_{\max}^A + θC_{\max}^B, for a given priority weight θ≥1θ\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≤θ≤1+521 \leq θ\leq \tfrac{1+\sqrt{5}}{2}, we propose novel online algorithm which achieves a competitive ratio of 1+θ1+θ1+\tfracθ{1+θ}. This result matches the theoretical lower bound.

查看此版本解读 →查看此版本原文 ↗