arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.06841cs.DScs.DM
收藏

基于(max,+)-卷积的加权拖期作业数极小化

Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions

Danny Hermelin, Hendrik Molter, Dvir Shabtay

摘要:

的$1 \mid \mid Σw_j U_j$问题要求确定-给定$n$工作,每个有自己的处理时间,重量,和到期日-在任何单机非抢占式调度这些工作的最小加权数迟到的工作。这是一个经典的调度问题,概括了背包和子集和。用于$1 \mid \mid Σw_j U_j$的最著名的伪多项式算法是由Lawler和Moore [Management Science'69]提出的,可以追溯到60年代后期,其运行时间为$O(d_{\max}n)$,其中$n$是作业数,$d_{\max}$是它们的最大到期日。Cygan \emph{et al.} ~[ICALP'19]最近对背包问题给出的一个下界表明,在一个合理的猜想下,对于任何$\varepsilon > 0$,$1 \mid \mid Σw_j U_j$都不能在$\widetilde{O}((n+d_{\max})^{2-\varepsilon})$时间内求解.这仍然留下了差距之间的最知名的下限和上限的问题。本文设计了一种新的简单的$1 \mid \mid Σw_j U_j$算法,该算法以$(\max,+)$ -卷积为主要工具,并在几个参数范围内优于Lawler和Moore算法。特别地,根据计算$(\max,+)$ -卷积的具体方法,其运行时间可以由- $\widetilde{O}(n+d_{\#}d_{\max}^2)$限定。- $\widetilde{O}(d_{\#}n +d^2_{\#}d_{\max}w_{\max})$。- $\widetilde{O}(d_{\#}n +d_{\#}d_{\max}p_{\max})$。- $\widetilde{O}(n^2 +d_{\max}w^2_{\max})$。- $\widetilde{O}(n^2 + d_{\#}(d_{\max}w_{\max})^{1.5})$。这里,$d_{\#}$表示实例中的\emph{different}到期日的数量,$p_{\max}$表示任何作业的最大处理时间,$w_{\max}$表示任何作业的最大权重。

英文摘要:

The $1 \mid \mid Σw_j U_j$ problem asks to determine -- given $n$ jobs each with its own processing time, weight, and due date -- the minimum weighted number of tardy jobs in any single machine non-preemptive schedule for these jobs. This is a classical scheduling problem that generalizes both Knapsack, and Subset Sum. The best known pseudo-polynomial algorithm for $1 \mid \mid Σw_j U_j$, due to Lawler and Moore [Management Science'69], dates back to the late 60s and has a running time of $O(d_{\max}n)$, where $n$ is the number of jobs and $d_{\max}$ is their maximal due date. A recent lower bound by Cygan \emph{et al.}~[ICALP'19] for Knapsack shows that $1 \mid \mid Σw_j U_j$ cannot be solved in $\widetilde{O}((n+d_{\max})^{2-\varepsilon})$ time, for any $\varepsilon > 0$, under a plausible conjecture. This still leaves a gap between the best known lower bound and upper bound for the problem. In this paper we design a new simple algorithm for $1 \mid \mid Σw_j U_j$ that uses $(\max,+)$-convolutions as its main tool, and outperforms the Lawler and Moore algorithm under several parameter ranges. In particular, depending on the specific method of computing $(\max,+)$-convolutions, its running time can be bounded by - $\widetilde{O}(n+d_{\#}d_{\max}^2)$. - $\widetilde{O}(d_{\#}n +d^2_{\#}d_{\max}w_{\max})$. - $\widetilde{O}(d_{\#}n +d_{\#}d_{\max}p_{\max})$. - $\widetilde{O}(n^2 +d_{\max}w^2_{\max})$. - $\widetilde{O}(n^2 + d_{\#}(d_{\max}w_{\max})^{1.5})$. Here, $d_{\#}$ denotes the number of \emph{different} due dates in the instance, $p_{\max}$ denotes the maximum processing time of any job, and $w_{\max}$ denotes the maximum weight of any job.

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

↑