← 研踪 PaperTrailarXiv:2611.25953 · v1
Below Three: A 2.8027-Approximation for Moldable Precedence Scheduling
首次提交 2026-11-19 19:41
版本更新 2026-11-19 19:41
雷达观测 2026-11-20 16:53
摘要
We study makespan minimisation for nonpreemptive moldable jobs with arbitrary precedence constraints on identical processors. Each job runs on a chosen number of processors that remains fixed throughout its execution. Allocating more processors to a job can shorten its execution, but may increase total work and delay other jobs. We assume nonincreasing processing times, nondecreasing work, and a convex duration--work relation after dominated allocations are removed. This model includes jobs with concave speedup, for which Jansen and Zhang obtained a -approximation. Independently and concurrently with our work, Chen obtained a -approximation for the full convex model and a -approximation for concave speedup. We give a deterministic polynomial-time -approximation for the full convex model and every number of processors. Our result breaks the factor-three barrier for this model and also improves the approximation guarantee for concave speedup.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-19 19:41 · 最新观测版本
Below Three: A 2.8027-Approximation for Moldable Precedence Scheduling
We study makespan minimisation for nonpreemptive moldable jobs with arbitrary precedence constraints on identical processors. Each job runs on a chosen number of processors that remains fixed throughout its execution. Allocating more processors to a job can shorten its execution, but may increase total work and delay other jobs. We assume nonincreasing processing times, nondecreasing work, and a convex duration--work relation after dominated allocations are removed. This model includes jobs with concave speedup, for which Jansen and Zhang obtained a -approximation. Independently and concurrently with our work, Chen obtained a -approximation for the full convex model and a -approximation for concave speedup. We give a deterministic polynomial-time -approximation for the full convex model and every number of processors. Our result breaks the factor-three barrier for this model and also improves the approximation guarantee for concave speedup.
查看此版本解读 →查看此版本原文 ↗