论文标题
伪人类算法，以最大程度地减少多台相关机器上的最大迟到
A Pseudopolynomial Algorithm to Minimize Maximum Lateness on Multiple Related Machines
论文作者
论文摘要
在本文中，我们将找到一种伪型算法来解决$ qm \ qm \ mid \ mid l _ {\ max} $，然后我们将证明，在多项式时间中不可能获得任何恒定因素近似，因此也不可能解决这个问题的PTA。我们还将证明，当我们不假设固定数量的机器时，问题是$ p \ p \ id \ ind \ mid l _ {\ max} $，这是强烈的np-hard。
In this paper, we will find a pseudopolynomial algorithm to solve $Qm \mid \mid L_{\max}$ and then we will prove that it is impossible to get any constant-factor approximation in polynomial time, and thus also impossible to have a PTAS for this problem. We will also show that the the problem when we don't assume a fixed number of machines, $P \mid \mid L_{\max}$, is strongly NP-hard.
