Métodos heurísticos aplicados a problemas de dimensionamento de lotes em máquinas paralelas com restrições de capacidade

Abstract

As far as production planning is concerned, lot-sizing problems are important models for obtaining an optimal production plan. In this work, the lot-sizing problem with multiple items and capacity constraint with parallel machines was used. It is sought to obtain fast and viable solutions through the combination of the rounding heuristic based on the generation of columns and the heuristic Fix-and-Optimize for the problem. The results of the proposed approaches are obtained through computational simulations, which are then analyzed in order to verify the level of quality and computational performance. Finally, the results are compared with other results found in the literature. The method used proves to be efficient and able to obtain good lower bounds and upper bounds.