Production processes comprising both the lot-sizing problem and the cutting stock problem are frequent in various industrial sectors. However these problems are usually treated separately, which can generates suboptimal ...

The present paper solves the multi-level capacitated lot sizing problem with backlogging (MLCLSPB) combining a genetic algorithm with the solution of mixed-integer programming models and the improvement heuristic fix and ...

The present paper solves the multi-level capacitated lot sizing problem with backlogging (MLCLSPB) combining a genetic algorithm with the solution of mixed-integer programming models and the improvement heuristic fix and ...

In many production processes, a key material is prepared and then transformed into different final products. The lot sizing decisions concern not only the production of final products, but also that of material preparation ...

In many productive processes, two important problems arise in the production planning: the lot-sizing problem and the cutting stock problem. Generally, companies deal with these problems separately but, by considering them ...

In this paper we present a mixed integer model that integrates lot sizing and lot scheduling decisions for the production planning of a soft drink company. The main contribution of the paper is to present a model that ...

In this paper we present a mixed integer model that integrates lot sizing and lot scheduling decisions for the production planning of a soft drink company. The main contribution of the paper is to present a model that ...

The aim of this paper is to classify the literature related to the integration between the lot-sizing and cutting stock problem. A deterministic mathematical model, that considers multiple dimensions of integration and ...

We consider the capacitated lot sizing problem with multiple items, setup time and unrelated parallel machines. The aim of the article is to develop a Lagrangian heuristic to obtain good solutions to this problem and good ...