The Capacitated Multi-Item Dynamic Lot-Sizing Problem

A previous article by Dogramaci, Panayiotopoulos, and Adam [1] proposed a unidirectional forward pass algorithm for the multiple-item limited capacity lot-sizing problem. The algorithm guarantees a feasible solution to any problem for which a feasible solution exists. A not unusual problem is presented here that cannot be solved to a feasible schedule by the algorithm. The difficulty is due to lumpy demand and to the algorithm's choice of shifting entire lots before split lots. A modification to the original algorithm prevents the infeasibility from occurring.