← 研踪 PaperTrailarXiv: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
摘要
We give a deterministic exact algorithm for for every fixed . The algorithm constructs an optimum schedule in elementary RAM operations, where is the number of jobs and is the binary input length. Its word size is bits. An implementation with a fixed number of tapes uses steps. For three machines the respective polynomial degrees are and , apart from the displayed logarithmic factors.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-06 20:32 · 最新观测版本
Precedence Constraint Scheduling on a Fixed Number of Machines
We give a deterministic exact algorithm for for every fixed . The algorithm constructs an optimum schedule in elementary RAM operations, where is the number of jobs and is the binary input length. Its word size is bits. An implementation with a fixed number of tapes uses steps. For three machines the respective polynomial degrees are and , apart from the displayed logarithmic factors.
查看此版本解读 →查看此版本原文 ↗