![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
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.