… In this article, we consider single-level lot sizing problems, … problems, and introducing
different variants of lot sizing and scheduling problems, we discuss single-level lot sizing problems, …

… We address the capacitated lot-sizing problem (CLSP) and give a state-of-the-art literature
review with respect to … The latter two include scheduling decisions into the lot-sizing problem. …

… separates the lot-sizing problem from the detailed sequencing and scheduling problem.
Our conceptional point of reference is the multi-level capacitated lot-sizing problem (MLCLSP). …

… The multi-item capacitated lot-sizing problem consists of determining the magnitude and
the … We show that the problem is strongly NP-hard. To explain why one of the most popular …

… This paper presents an optimization-based solution approach for the dynamic multi-level
capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a …

… capacitated lot sizing problem, there has been insufficient consideration of planning problems
in which it is possible for a lot size, … for the capacitated lot sizing problem that incorporate …

… Lot sizing is one of the most important decisions taken during production planning in all …
Among the various basic lot sizing models, the Capacitated Lot Sizing Problem (CLSP) is the …

… 3 Single item capacitated lot sizing problem with inventory bounds We consider now the
single item capacitated lot sizing problem with inventory bounds (single-item CLSP-IB). …

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 …

… In this subsection, we discuss the capacitated lot sizing problem with only disposal. Then
the general model can be reformulated as min ∑ t = 1 T ( f t ( x t ) + θ t ( I t r ) ) subject to I t r = I t …