Lower bounds for the economic lot scheduling problem using aggregation

The problem considered in this paper is to choose cyclical production patterns for several products which are produced on a common production facility. By aggregating data, dynamic programming can be used to obtain lower bounds which, in general, are much stronger than those obtained when the capacity constraint is not recognized.Lower bounds are of interest when generating possible solutions and also in connection with branch-and-bound methods.