论文标题
连续的关节补给问题是NP-HARD的强烈
The Continuous Joint Replenishment Problem is Strongly NP-Hard
论文作者
论文摘要
在过去的半个世纪中，连续的周期性联合补给问题（CPJRP）一直是供应链管理中供应链管理方面的核心问题之一。尽管如此，尽管在研究这个问题上付出了巨大的努力，但其复杂性已避免了多年的研究人员。尽管CPJRP具有1.02的更紧密的常数近似值之一，但从未找到多项式的最佳解决方案。最近，该问题的离散版本最终被证明是NP-HARD。在本文中，我们扩展了这一结果，最终证明了CPJRP问题也很强烈。
The Continuous Periodic Joint Replenishment Problem (CPJRP) has been one of the core and most studied problems in supply chain management for the last half a century. Nonetheless, despite the vast effort put into studying the problem, its complexity has eluded researchers for years. Although the CPJRP has one of the tighter constant approximation ratio of 1.02, a polynomial optimal solution to it was never found. Recently, the discrete version of this problem was finally proved to be NP-hard. In this paper, we extend this result and finaly prove that the CPJRP problem is also strongly NP-hard.
