跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.09392 · v1

Precedence Constraint Scheduling on a Fixed Number of Machines

首次提交 2026-11-06 20:32
版本更新 2026-11-06 20:32
雷达观测 2026-11-09 11:19
arXiv ↗PDF ↗

摘要

We give a deterministic exact algorithm for Pm∣prec,pj=1∣Cmax⁡P_m\mid\mathrm{prec},p_j=1\mid C_{\max} for every fixed m≥3m\ge3. The algorithm constructs an optimum schedule in O(L)+mO(m2) n6m2+13m+1 log⁡n O(L)+m^{O(m^2)}\, n^{6m^2+13m+1} \, {\log n} elementary RAM operations, where n≥2n \ge 2 is the number of jobs and LL is the binary input length. Its word size is O(m2log⁡n)O(m^2 \log n) bits. An implementation with a fixed number of tapes uses O(L)+mO(m2) n12m2+26m+2 log⁡3nO(L)+m^{O(m^2)} \, n^{12m^2+26m+2} \, \log^3 n steps. For three machines the respective polynomial degrees are 9494 and 188188, apart from the displayed logarithmic factors.

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

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

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-06 20:32 · 最新观测版本

Precedence Constraint Scheduling on a Fixed Number of Machines

We give a deterministic exact algorithm for Pm∣prec,pj=1∣Cmax⁡P_m\mid\mathrm{prec},p_j=1\mid C_{\max} for every fixed m≥3m\ge3. The algorithm constructs an optimum schedule in O(L)+mO(m2) n6m2+13m+1 log⁡n O(L)+m^{O(m^2)}\, n^{6m^2+13m+1} \, {\log n} elementary RAM operations, where n≥2n \ge 2 is the number of jobs and LL is the binary input length. Its word size is O(m2log⁡n)O(m^2 \log n) bits. An implementation with a fixed number of tapes uses O(L)+mO(m2) n12m2+26m+2 log⁡3nO(L)+m^{O(m^2)} \, n^{12m^2+26m+2} \, \log^3 n steps. For three machines the respective polynomial degrees are 9494 and 188188, apart from the displayed logarithmic factors.

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