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

单机加工拖期的快速最小化

Quick Minimization of Tardy Processing Time on a Single Machine

Baruch Schieber, Pranav Sitaraman

摘要:

本文考虑在单机上极小化拖期工件的总加工时间的问题。这是一个经典的调度问题,首先考虑的[Lawler和Moore 1969],也推广了子集和问题。最近,它表明,这个问题可以有效地解决计算$(\max,\min)$ -斜卷积。所得到的算法的运行时间等于计算两个整数向量的$(\max,\min)$ -偏斜卷积所需的时间,其和为$O(P)$,其中$P$是作业的处理时间之和。我们进一步提高了运行时间的最小延迟处理时间计算通过引入一个作业的“blacking”技术,并实现了一个$\tilde{O}\left(P^{2-1/α}\right)$运行时间,其中$\tilde{O}\left(P^α\right)$是一个$(\max,\min)$的运行时间的大小为$P$的向量的斜卷积。这导致了用于延迟处理时间最小化的$\tilde{O}\left(P^{7/5}\right)$时间算法,这是对先前已知的$\tilde{O}\left(P^{5/3}\right)$时间算法的改进。

英文摘要:

We consider the problem of minimizing the total processing time of tardy jobs on a single machine. This is a classical scheduling problem, first considered by [Lawler and Moore 1969], that also generalizes the Subset Sum problem. Recently, it was shown that this problem can be solved efficiently by computing $(\max,\min)$-skewed-convolutions. The running time of the resulting algorithm is equivalent, up to logarithmic factors, to the time it takes to compute a $(\max,\min)$-skewed-convolution of two vectors of integers whose sum is $O(P)$, where $P$ is the sum of the jobs' processing times. We further improve the running time of the minimum tardy processing time computation by introducing a job ``bundling'' technique and achieve a $\tilde{O}\left(P^{2-1/α}\right)$ running time, where $\tilde{O}\left(P^α\right)$ is the running time of a $(\max,\min)$-skewed-convolution of vectors of size $P$. This results in a $\tilde{O}\left(P^{7/5}\right)$ time algorithm for tardy processing time minimization, an improvement over the previously known $\tilde{O}\left(P^{5/3}\right)$ time algorithm.

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

↑