OPTIMAL MULTILEVEL LOT SIZING FOR REQUIREMENTS PLANNING SYSTEMS

An optimal procedure is developed for the multi-period, multi-product, multi-level lot sizing problem by modeling the system as a constrained generalized network with fixed charge arcs and side constraints. The network permits us to relax some of the more restrictive assumptions of previous models such as those designed for product structures with single sources or successors. The solution to the resulting minimum cost flow problem yields optimal lot sizing decisions for all purchases as well as manufactured goods and components in all periods over a finite planning horizon. A simple illustration, beginning with a master production schedule and bills of material, illustrates the suitability of this approach for modeling complex requirements planning systems. Optimal solutions obtained by this method may also be useful in comparing results obtained from future heuristic approaches which may be more computationally efficient.