Abstract
In this paper, we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention over the years, and many heuristic and approximation algorithms have been suggested. However, in spite of the vast effort, the complexity of the problem remains unresolved. In this paper, we provide a proof that the problem is indeed strongly NP-hard.
| Original language | English |
|---|---|
| Pages (from-to) | 1269-1289 |
| Number of pages | 21 |
| Journal | Mathematics of Operations Research |
| Volume | 43 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1 Jan 2018 |
| Externally published | Yes |
Keywords
- Computational complexity
- Joint replenishment problem
- Supply chain management
- Twin primes
ASJC Scopus subject areas
- General Mathematics
- Computer Science Applications
- Management Science and Operations Research