2020/06/07 by Alexander Tuisov, Tuisov, Alexander, Liron Yedidsion +1 · 1 citation
Business, Management and Accounting · Engineering · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Packing Problems #Scheduling and Optimization Algorithms #Supply Chain and Inventory Management
paper · pdf · doi:10.48550/arxiv.2006.05310
openalex publication_date 2020/06/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.