A major argument for favoring simple lot-sizing heuristics---like the Silver/Meal or Groff's heuristic---to solve instances of the dynamic single-level uncapacitated lot-sizing problem (SLLSP) instead of exact algorithms---like those of Wagner/Whitin or Federgruen/Tzur---is that exact algorithms...

In this paper a new mixed integer programming (MIP) model formulation and its incorporation into a time-oriented decomposition heuristic for the capacitated lot-sizing problem with linked lot sizes (CLSPL) is proposed. The solution approach is based on an extended model formulation and valid...