Network-based optimization algorithms for the capacitated multi-item lot sizing problem

Abstract

The capacitated, multi-item lot size problem is modeled as a fixed-charge single-commodity network flow problem. A branch and bound algorithm is developed which generally finds optimal solutions early in the search process. This property is exploited in developing heuristics that are based on the branch and bound scheme. Computational experience is discussed.