Advanced search
Start date

Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings

Grant number: 22/05803-3
Support Opportunities:Research Projects - Thematic Grants
Duration: May 01, 2023 - April 30, 2028
Field of knowledge:Engineering - Production Engineering - Operational Research
Principal Investigator:Reinaldo Morabito Neto
Grantee:Reinaldo Morabito Neto
Host Institution: Centro de Ciências Exatas e de Tecnologia (CCET). Universidade Federal de São Carlos (UFSCAR). São Carlos , SP, Brazil
Pesquisadores principais:
Débora Pretti Ronconi ; Horacio Hideki Yanasse ; Mariá Cristina Vasconcelos Nascimento Rosset ; Maristela Oliveira dos Santos ; Pedro Augusto Munari Junior ; Silvio Alexandre de Araujo
Associated researchers:Adriana Cristina Cherri ; Andrea Carla Gonçalves Vianna ; Antônio Augusto Chaves ; Carla Taviane Lucke da Silva Ghidini ; Carlos Alberto Alonso Sanches ; Claudio Fabiano Motta Toledo ; Cleber Damião Rocco ; Deisemara Ferreira ; Diego Jacinto Fiorotto ; Edilaine Martins Soler ; Eli Angela Vitor Toso ; Ernesto Julián Goldberg Birgin ; Flávio Keidi Miyazawa ; Helio Yochihiro Fuchigami ; Kelly Cristina Poldi ; Lehilton Lelis Chaves Pedrosa ; Leonardo Junqueira ; Luis Felipe Cesar da Rocha Bueno ; Luiz Gustavo Bizarro Mirisola ; Luiz Leduíno de Salles Neto ; Maria Do Socorro Nogueira Rangel ; Maria José Pinto ; Marina Andretta ; Mônica Maria de Marchi ; Nei Yoshihiro Soma ; Rafael Crivellari Saliba Schouery ; Roberto Fernandes Tavares Neto ; Sônia Cristina Poltroniere ; Victor Claudio Bento de Camargo ; Vitória Maria Miranda Pureza ; Washington Alves de Oliveira
Associated scholarship(s):23/13972-2 - Approximation Algorithms for Packing and Independent Set Problems, BP.IC
23/10381-3 - Integer solutions for the one-dimensional cutting stock problem with usable leftovers, BP.IC
23/07639-9 - Relax-and-fix heuristic for the lot-sizing problem: solution strategies and applications, BP.IC
22/16817-5 - Robust Optimization applied to the Vehicle Allocation Problem, BP.IC


This project addresses a wide range of discrete optimization and operations research problems, and aims to contribute with innovative approaches and solutions to production and supply chain management problems. The problems focused in this thematic project are divided into: (A) cutting problems, (B) packing problems, (C) lot-sizing problems, (D) scheduling problems, (E) routing problems (F) location problems and (G) the integration of these problems. In addition to the study and development of mathematical models related to these problems, solution methods and algorithms to solve them will be developed, and their computational performances will be analyzed. The project also aims to continue the integration and collaboration of research groups from different institutions interested in these issues, as well as human resource training for research and technological developments. It is intended to intensify cooperation between the productive sector and academia, with the development of case studies in companies. It is expected, therefore, to enable collaborations and partnerships in the study of these problems and in the development of computational tools to be used in practice. The team of this project is composed of several researchers at various stages of their academic careers, from graduate students and recent doctors, to experienced researchers. This project is a continuation of three other FAPESP Thematic Projects, the first being developed between 2006 and 2010, the second between 2010 and 2015 and, the third between 2017 and 2023. In the first two projects, problems were studied mainly in (A), (B), (C), (D), as well as some integration of these problems (G). In the third project, problems (E) and (F) were added and the study of the integrations between the problems was intensified. (AU)

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

Scientific publications
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
SEMAN, LAIO ORIEL; RIGO, CEZAR ANTONIO; CAMPONOGARA, EDUARDO; MUNARI, PEDRO; BEZERRA, EDUARDO AUGUSTO. Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm. Computers & Operations Research, v. 158, p. 17-pg., . (22/05803-3, 13/07375-0)
BECKER, HENRIQUE; MARTIN, MATEUS; ARAUJO, OLINTO; BURIOL, LUCIANA S. S.; MORABITO, REINALDO. Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem. International Transactions in Operational Research, v. N/A, p. 26-pg., . (22/05803-3, 16/01860-1)

Please report errors in scientific publications list using this form.