arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.13357cs.DS
收藏

在近线性时间内最小化单机上的延迟处理时间

Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time

Nick Fischer, Leo Wennmann

AI总结:

本文针对单机调度问题 $1||\sum p_j U_j$ 提出近线性时间 $\tilde O(P)$ 算法,显著超越此前 $\tilde O(P^{7/5})$ 的结果,并匹配条件性下界,且可扩展到多机情形。

摘要:

在本文中,我们重新审视了基础调度问题 $1||\sum p_j U_j$。其目标是在 $n$ 个具有处理时间和截止日期的作业中,选择一个总处理时间最大的子集,使得这些作业能够按顺序调度且不违反其截止日期。该问题是 NP 难的,但 Lawler 和 Moore 在 60 年代提出的经典算法可以在伪多项式时间 $O(nP)$ 内解决该问题,其中 $P$ 是所有作业的总处理时间。为了开发尽可能最优的伪多项式时间算法,最近一系列结果已经改进了针对 $1||\sum p_j U_j$ 的 Lawler 和 Moore 算法:首先改进到时间 $\tilde O(P^{7/4})$ [Bringmann, Fischer, Hermelin, Shabtay, Wellnitz; ICALP'20],然后到时间 $\tilde O(P^{5/3})$ [Klein, Polak, Rohwedder; SODA'23],最后到时间 $\tilde O(P^{7/5})$ [Schieber, Sitaraman; WADS'23]。这些工作能否被进一步改进,一直是一个令人兴奋的开放问题。在本文中,我们为 $1||\sum p_j U_j$ 问题开发了一个近线性时间 $\tilde O(P)$ 的算法。这一运行时间不仅显著优于之前的结果,而且与基于强指数时间假设或集合覆盖假设的条件性下界相匹配,因此很可能是最优的(最多相差次多项式因子)。我们的新算法还扩展到 $m$ 台机器的情况,运行时间为 $\tilde O(P^m)$。与之前的改进不同,我们采用了一种不同的、更直接的方法,该方法受到最近从 Modular Subset Sum 到动态字符串问题的归约的启发。由此,我们得到了一个令人满意的简单算法。

英文摘要:

In this work we revisit the elementary scheduling problem $1||\sum p_j U_j$. The goal is to select, among $n$ jobs with processing times and due dates, a subset of jobs with maximum total processing time that can be scheduled in sequence without violating their due dates. This problem is NP-hard, but a classical algorithm by Lawler and Moore from the 60s solves this problem in pseudo-polynomial time $O(nP)$, where $P$ is the total processing time of all jobs. With the aim to develop best-possible pseudo-polynomial-time algorithms, a recent wave of results has improved Lawler and Moore's algorithm for $1||\sum p_j U_j$: First to time $\tilde O(P^{7/4})$ [Bringmann, Fischer, Hermelin, Shabtay, Wellnitz; ICALP'20], then to time $\tilde O(P^{5/3})$ [Klein, Polak, Rohwedder; SODA'23], and finally to time $\tilde O(P^{7/5})$ [Schieber, Sitaraman; WADS'23]. It remained an exciting open question whether these works can be improved further. In this work we develop an algorithm in near-linear time $\tilde O(P)$ for the $1||\sum p_j U_j$ problem. This running time not only significantly improves upon the previous results, but also matches conditional lower bounds based on the Strong Exponential Time Hypothesis or the Set Cover Hypothesis and is therefore likely optimal (up to subpolynomial factors). Our new algorithm also extends to the case of $m$ machines in time $\tilde O(P^m)$. In contrast to the previous improvements, we take a different, more direct approach inspired by the recent reductions from Modular Subset Sum to dynamic string problems. We thereby arrive at a satisfyingly simple algorithm.

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

↑