带交货期和总加权完工时间目标的优先约束单机排序问题的2.542近似解
A 2.542-Approximation for Precedence Constrained Single Machine Scheduling with Release Dates and Total Weighted Completion Time Objective
摘要:
本文提出了一种求解单机上工件在优先约束和交货期约束下加权完工时间之和最小化的非抢占式排序问题的$\sqrt{e}/(\sqrt{e}-1)$ -近似算法。以前最著名的近似算法可以追溯到1997年;其性能保证可以任意接近欧拉常数$e$。
英文摘要:
We present a $\sqrt{e}/(\sqrt{e}-1)$-approximation algorithm for the nonpreemptive scheduling problem to minimize the total weighted completion time of jobs on a single machine subject to release dates and precedence constraints. The previously best known approximation algorithm dates back to 1997; its performance guarantee can be made arbitrarily close to the Euler constant $e$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。