Integer Factorization: Why Two-Item Joint Replenishment Is Hard 2: For Odd Composite M, Every Optimal Plan of an Explicit Two-Item Periodic JRP Instance Has q₂ = M and 1 < gcd(q₁, M) < MResearch Paper
The joint replenishment problem (JRP) is a basic model of inventory coordination: several items are ordered from one supplier, each item pays its own ordering and holding costs, and an additional item-independent joint ordering cost rewards ordering the items at common times. Two accounting conventions are studied. In the periodic JRP (also called the…