A heuristic framework based on linear programming to solve the constrained joint replenishment problem (C-JRP)

This paper presents a new approach to solve the joint replenishment problem under deterministic demand and resource constraints (C‐JRP). To solve the problem, a heuristic framework based on linear programming is presented. The proposed method can be extended to solve different versions of the problem and can be extended with linear programming modeling. This method is analyzed and some tests are performed, the results of which show that the proposed algorithm outperforms other well‐known algorithms in total cost.