最小化延迟处理时间、最大最小斜卷积和三角结构ILP
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs
摘要:
本文的出发点是在单机上调度具有加工时间和交货期的$n$工件,使拖期工件的总加工时间最小化的问题,即,$1||\sum p_j U_j$。这个问题被Bringmann等人(Bringmica 2022)确定为经典$1||\sum w_j U_j$问题的自然次二次时间特殊情况,由于细粒度下限,该问题可能需要总处理时间$P$中的时间二次。Bringmann等人~通过一种新的卷积变体获得他们的$\tilde{O}(P^{7/4})$时间调度算法,称为Max-Min Skewed Convolution,他们在$\tilde{O}(n^{7/4})$时间内解决。我们的主要技术贡献是在$\tilde{O}(n^{5/3})$时间内运行的更快、更简单的卷积算法。它意味着$1||\sum p_j U_j$的$\tilde{O}(P^{5/3})$时间算法,但也可能是独立的兴趣。受子集和问题和背包问题的启发,我们研究了以最大作业处理时间$p_{\max}$为参数的$1||\sum p_j U_j$.与邻近技术借用整数线性规划(ILP),我们显示的问题的结构特性,再加上一个新的动态规划制定,导致一个$\tilde{O}(n+p_{\max}^3)$时间算法。此外,在多机环境下,我们使用类似的技术得到了$Pm||\sum p_j U_j$的$n \cdot p_{\max}^{O(m)}$时间算法。最后,我们指出,所考虑的问题表现出一个特殊的三角块结构的约束矩阵的ILP配方。根据最近的ILP研究,出现的一个问题是,是否可以设计这样一类ILP的通用算法。我们给这个问题一个否定的答案:我们表明,已经稍微概括的结构的调度ILP导致一个强NP-难的问题。
英文摘要:
The starting point of this paper is the problem of scheduling $n$ jobs with processing times and due dates on a single machine so as to minimize the total processing time of tardy jobs, i.e., $1||\sum p_j U_j$. This problem was identified by Bringmann et al. (Algorithmica 2022) as a natural subquadratic-time special case of the classic $1||\sum w_j U_j$ problem, which likely requires time quadratic in the total processing time $P$, because of a fine-grained lower bound. Bringmann et al.~obtain their $\tilde{O}(P^{7/4})$ time scheduling algorithm through a new variant of convolution, dubbed Max-Min Skewed Convolution, which they solve in $\tilde{O}(n^{7/4})$ time. Our main technical contribution is a faster and simpler convolution algorithm running in $\tilde{O}(n^{5/3})$ time. It implies an $\tilde{O}(P^{5/3})$ time algorithm for $1||\sum p_j U_j$, but may also be of independent interest. Inspired by recent developments for the Subset Sum and Knapsack problems, we study $1||\sum p_j U_j$ parameterized by the maximum job processing time $p_{\max}$. With proximity techniques borrowed from integer linear programming (ILP), we show structural properties of the problem that, coupled with a new dynamic programming formulation, lead to an $\tilde{O}(n+p_{\max}^3)$ time algorithm. Moreover, in the setting with multiple machines, we use similar techniques to get an $n \cdot p_{\max}^{O(m)}$ time algorithm for $Pm||\sum p_j U_j$. Finally, we point out that the considered problems exhibit a particular triangular block structure in the constraint matrices of their ILP formulations. In light of recent ILP research, a question that arises is whether one can devise a generic algorithm for such a class of ILPs. We give a negative answer to this question: we show that already a slight generalization of the structure of the scheduling ILP leads to a strongly NP-hard problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。