SYSTEMATIC REVIEW ON FORMULATIONS AND MATHEURISTICS FOR BATCH SIZING AND SEQUENCING PROBLEMS

The lot sizing and sequencing problems stand out as important problems in production planning, being present in several industrial contexts and frequently addressed through Mixed Integer Linear Programming models. These problems present high computational complexity, especially when involving capacity constraints, setup times and costs, multiple products, and integration with logistics and distribution decisions. In this context, the literature proposes different mathematical formulations aiming to improve the quality of linear relaxations and the computational performance of solution methods. Besides the classical formulation, formulations based on facility location and shortest path problems stand out for providing stronger linear relaxations and better dual bounds. At the same time, there is a growing use of matheuristics and heuristics based on mathematical models, such as relax-and-fix, fix-and-optimize, and rolling horizon approaches, applied to solving lot sizing and sequencing problems. However, most of these approaches still rely predominantly on classical formulations, while only a few studies explore the use of alternative formulations within these solution strategies.