Abstract
This paper addresses a dynamic lot sizing problem with mixed returning items and disposals and bounded inventory. The returning items mean that returns are in good enough condition to re-enter the inventory supply stream. The producing, the holding, backlogging and disposals cost functions are concave cost functions. Furthermore, backlogging level and inventory level at each period is limited. The goal is to minimize the total cost of production, inventory holding/backlogging and disposal. A dynamic programming algorithm with complexity O(T3) is developed to solve this model, where T is the length of the planning horizon.
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.
