Abstract

This paper deals with the Joint Replenishment Problem (JRP) in multi item and multi site settings based on the common cycle strategy. The proposed delivery planning method, in deterministic and constant demand environment, uses Mixed Integer Linear Programming (MILP) algorithm. It is shown that the proposed MILP method gives better results in terms of reduced total replenishment cost than the standard delivery policy for which there is a periodicity of delivery for all the pairs (product, site).

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.