A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The multi-item single level capacitated dynamic lot-sizing problem consists of scheduling N items over a horizon of T periods. The objective is to minimize the sum of setup and inventory holding costs over the horizon subject to a constraint on total capacity in each period. No backlogging is allowed. Only one machine is available with a fixed capacity in each period. In case of a single item production, an optimal solution algorithm exists. But for multi-item problems, optimal solutiondoi:10.3329/jme.v38i0.893 fatcat:egimbkha4nam3j2yv6kl33adpu