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

Ciro Alberto Amaya, Jimmy Carvajal and Fabian Castaño

International Journal of Production Economics, 2013, vol. 144, issue 1, 243-247

Abstract: 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.

Keywords: Constrained joint replenishment problem; Inventory policies; Linear programming; CRAND heuristic (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527313000753
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:144:y:2013:i:1:p:243-247

DOI: 10.1016/j.ijpe.2013.02.008

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().