Abstract
In this paper we study a class of multi-item lot-sizing problems with dynamic demands, as well as lower and upper bounds on a shared resource with a piecewise linear cost. The shared resource might be supply, production or transportation capacity. The model is particularly applicable to problems with joint shipping and/or purchasing cost discounts. The problem is formulated as a mixed-integer program. Lagrangean relaxation is used to decompose the problem into a set of simple sub-problems. A heuristic method based on sub-gradient optimization is then proposed to solve a particular case often encountered in the consumer goods wholesaling and retailing industry. Our tests show that the heuristic proposed is very efficient in solving large real-life supply planning problems.
Sign-in/Register to access full text options 
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.
