Abstract
This paper presents a generalized production-inventory-routing model with perishable inventory. We analyze the optimal integrated decisions of when and how much to deliver and sell products with varying manufacturing periods. We discuss main inventory management policies to demonstrate the applicability of the model in real-world applications for production routing problems (PRPs) with perishable inventory. Furthermore, an exact branch-and-cut algorithm is developed and discussed. We introduce new families of logical, strengthened lot-sizing and lifted Miller–Tucker–Zemlin subtour elimination constraints for the PRP with perishable inventory. Finally, we test the performance of the algorithm. We also implement and compare 8 suboptimal delivery and selling priority policies with an optimized policy to develop managerial implications.
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 callDisclaimer: 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.
