Advanced search
Start date

Relax-and-fix heuristic for the lot-sizing problem: solution strategies and applications

Grant number: 23/07639-9
Support Opportunities:Scholarships in Brazil - Scientific Initiation
Effective date (Start): August 01, 2023
Effective date (End): July 31, 2024
Field of knowledge:Engineering - Production Engineering - Operational Research
Principal Investigator:Victor Claudio Bento de Camargo
Grantee:Lucas Gabriel Malheiros Machado Silva
Host Institution: Centro de Ciências Exatas e de Tecnologia (CCET). Universidade Federal de São Carlos (UFSCAR). São Carlos , SP, Brazil
Associated research grant:22/05803-3 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings, AP.TEM


This research project aims to study the relax-and-fix heuristic for the lot-sizing problem modelled by mixed integer programming. This heuristic is often proposed as a solution method for the problem because it is a heuristic based on mathematical programming, i.e. it uses the mathematical model of the problem itself in its constructive strategy. The proposal involves conducting a systematic literature review on the application of this method, exploring various characteristics of the heuristic for the problem, such as the partitions used, iteration strategies, time limit segmentation, treatment of solution infeasibility, and integration with other methods. The research aims to identify converging characteristics and potential areas for further development of the widely used heuristic for solving the lot-sizing problem.

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items

Please report errors in scientific publications list using this form.