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.
No takes yet. Share an insight, caveat, or question.
Maes et al. (1986) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: