Abstract
Abstract The multi item single level capacitated dynamic lotsizing problem consists of scheduling N items over a horizon of T periods. Demands are given and should be satisfied without backlogging. The objective is to minimize the sum of setup costs and inventory holding costs over the horizon subject to a constraint on total capacity in each period. Three simple heuristics from literature (Lambrecht and Vanderveken, Dixon and Silver, Dogramaci, Panayiotopoulos and Adam) are compared on a large set of test problems and their difference in performance is analyzed for various problem parameters.
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.
