Integer Factorization: Why Two-Item Joint Replenishment Is Hard 3: M Has a Divisor in [L, U] iff an Explicit Two-Item Periodic JRP Instance Has a Plan of Cost at Most L + U + 2M²(M + 1)Research Paper
The joint replenishment problem (JRP) is the multi-item extension of the economic order quantity (EOQ) model. Each item is reordered periodically and pays its own ordering and holding costs, and a joint ordering cost is shared by items ordered at the same time. Before this work no hardness result was known for the periodic JRP (p. 10), even though no exact…