This paper presents a new algorithm for the dynamic multi-level capacitated lot sizing
problem with setup carry-overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that …

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 …

The multi-item single-level capacitated lot-sizing problem consists of scheduling N different
items over a horizon of T periods. The objective is to minimize the sum of set-up and …

Although there is a significant amount of literature on the capacitated lot sizing problem,
there has been insufficient consideration of planning problems in which it is possible for a lot …

The capacitated lot-sizing problem (CLSP) is a standard formulation for big bucket lot-sizing
problems with a discrete period segmentation and deterministic demands. We present a …

This study proposes a heuristic approach for the solution of the dynamic multi-level multi-
item capacitated lot sizing problem (MLCLSP) with general product structures. The difficulty …

In this paper, a new model formulation for the dynamic multi-level capacitated lotsizing
problem with linked lotsizes is introduced. Linked lotsizes means that the model formulation …

This paper discusses the multi-product multi-level capacitated lotsizing and scheduling
problem with sequence-dependent setups. An exact formulation of the problem is provided …

The multi-stage capacitated lot sizing and loading problem (MCLSLP) deals with the issue of
determining the lot sizes of product items in serially-arranged manufacturing stages and …

The classical multi-level capacitated lot-sizing problem formulation is often not suitable to
correctly capture resource requirements and precedence relations. Depending on lead time …