arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.09900cs.DS
收藏

单机调度的紧凑枚举

Compact enumeration for scheduling one machine

Nodari Vakhania

AI总结:

本文针对单机调度中最小化最大延迟的强NP难问题,提出变参数分析方法,并设计隐式枚举算法和多项式时间近似方案,使指数复杂度仅依赖于特殊“新兴”作业的数量,实验表明该数量远小于n。

摘要:

我们在此引入的变参数(VP)分析,旨在给出精确的算法时间复杂度表达式,其中指数仅以变参数的形式出现。变参数是指具有特定问题相关属性的对象数量。本文描述了两个VP算法:一个隐式枚举算法和一个多项式时间近似方案,用于解决一个强NP难问题——在一台机器上调度n个具有发布时间和截止时间的独立作业,以最小化最大作业延迟。对于所考虑的问题,变参数是一类特殊的所谓“新兴”作业的数量。不含这些作业的部分解可在低阶多项式时间内构造,然后执行一个(以变参数数量为指数的)指数时间过程,将其扩充为完整的最优解。在我们推导的替代时间复杂度表达式中,指数依赖仅出现在某些作业参数上。将固定参数分析应用于这些估计,可获得纯多项式时间依赖。直观的概率估计和广泛的实验研究都支持一个直观明显的猜想:变参数的总数远小于n。特别是,其与n的比值渐近收敛于0。

英文摘要:

A Variable Parameter (VP) analysis, that we introduce here, aims to give a precise algorithm time complexity expression in which an exponent appears solely in terms of a variable parameter. A variable parameter is the number of objects with specific problem-dependent properties. Here we describe two VP-algorithms, an implicit enumeration algorithm and a polynomial-time approximation scheme for a strongly $NP$-hard problem of scheduling $n$ independent jobs with release and due times on one machine to minimize the maximum job lateness. For the problem considered, a variable parameter is the number of a special kind of the so-called ``emerging'' jobs. A partial solution without these jobs is constructed in a low degree polynomial time, and an exponential time procedure (in the number of variable parameters) is carried out to augment it to a complete optimal solution. In the alternative time complexity expressions that we derive, the exponential dependence is solely on some job parameters. Applying the fixed parameter analysis to these estimations, a purely polynomial-time dependence is obtained. Both, the intuitive probabilistic estimation and an extensive experimental study support an intuitively evident conjecture that the total number of the variable parameters is far less than $n$. In particular, its ratio to $n$ asymptotically converges to 0.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑