Abstract

The inventory control problem can be greatly simplified if the replenishments of inventory items are coordinated with one another. That is, whenever an item is replenished, n other items, where n is a decision variable, are also replenished. One way to ensure this would be to classify the inventory items into several groups with a common order interval for each group. In this paper we establish that the optimal groups will be consecutive by hD/A where h, D and A are the holding cost, demand rate and setup cost of an item, respectively. Using this consecutiveness property and incorporating a group overhead cost we develop a shortest-path model which creates the optimal groups. We compare our results with the policy of inventory coordination using integer multiplier constraints for order cycles.

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.