He holds a Bachelor's degree in Mathematics from the São Paulo State University Júlio de Mesquita Filho (1996), a bachelor's degree in Business Administration from the Institution Toledo de Ensino (1996), a master's degree in Computer Science and Computational Mathematics from the University of São Paulo (1999), a Ph.D. in Computer Science and Computational Mathematics from the University of São Paulo (part of it at the University of the West of England) (2003), and a postdoctoral degree from the London Business School (2009). Currently, he is a Full Professor (MS-6) at São Paulo State University (UNESP) São José do Rio Preto campus. From July 2019 to July 2020, he served as a visiting professor at HEC/Montreal-Canada, and since December 2020, he has been an associate member of GERAD (Group for Research in Decision Analysis). He has expertise in the areas of Applied Mathematics and Production Engineering, with emphasis on Optimization, working mainly on the following topics: production planning and scheduling, integrated lot sizing problems, cutting and packing problems, linear programming, mixed-integer programming, exact and heuristic methods. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
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 (…
The problems focused in this thematic project were 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 d…
In 2007 the applicant has started to develop financial supported projects on lot sizing problems integrated to other problems of optimization of the productive system. The applicant has done several contributions on the integration of the lot sizing problem with the scheduling problem, with the cutting and packing problem and with decisions related to the transportation of the produced it…
In 2007 the applicant has started to develop financial supported projects on lot sizing problems integrated to other problems of optimization of the productive system. The applicant has done several contributions on the integration of the lot sizing problem with the scheduling problem, with the cutting and packing problem and with decisions related to the transportation of the produced it…
(Only some records are available in English at this moment)
This project aims to investigate the integrated cutting stock and production scheduling problem, an optimization problem that simultaneously considers decisions related to cutting stock materials, with the goal of minimizing waste, and production scheduling, which involves the temporal allocation of tasks to available resources. The objective is to capture the interdependence between thes…
This research project deals with problems that appear in different industrial contexts. An important part of industrial production planning comprises solving the lot sizing problem, which consists of determining the decisions regarding the quantities of end products to be produced in each period over a planning horizon of finite and discrete time. In several manufacturing systems, the pro…
The Cutting Stock Problem (CSP) consists in determining the best way to cut bigger objects into small items, and it has been studied for decades. CSP is found in many industrialprocesses, and part of its actual research has focused on extensions and integrations of this problem with other operational aspects found in real industrial systems, for instance, lot sizing and alternative manufa…
The lot sizing problem consists in determining the quantity of products to be produced in each period over a finite time horizon in order to meet a certain demand and optimize an objective function, such as minimizing costs. With the natural evolution of the industrial decisions process, several strategies have been used to improve the decisions made, making them more complex. Among these…
In some industrial sectors, the lot sizing is strongly related to other important decisions of the production process. Such decisions can be made independently of lot size decisions or integrated using a mathematical model that simultaneously captures the relationships between problems. Within this updated context, and motivated by the technical and economic importance of the practical ap…
In view of the increasing competitiveness between industries, the search for efficient techniques to help the production planning is expanding, with the purpose of maximizing the productivity and improving the products quality. In this work, we approach the alveolar slabs planning production integrated to the optimization problem of the use of molds. Based on the production process of the…
(Only some records are available in English at this moment)
This project addresses issues arising in the context of industrial production and logistics planning, involving, respectively, the Lot Sizing Problem (LSP) and the Vehicle Routing Problem (VRP). We intend to continue ongoing joint research related to the LSP, its extensions, and integrations with other problems. Additionally, we will initiate collaboration regarding the VRP, focusing on l…
This research project focuses on industrial production planning problems that involve blending components to assemble end products, where the proportion of components used in the final composition can vary. The objective is to yield plans that minimize overall costs of blending components to meet external demand of end products. The plans also need to consider capacity time constraints an…
This research project aims to study arc-flow formulations and solutions methods applied to cutting stock problems. We intend to investigate extensions of problems inspired by industrial applications in which their actual solution methods lack improvements. To improve its computational performance, we propose to reformulate these problems using state-of-the-art arc-flow formulations. Arc-f…
In this research project, the main goal is to provide an updated literature review on modeling integrated of lot sizing problems. A secondary goal is to introduce new heuristic approaches for such integrated problems which can provide a high-quality solution in a small computational time. In particular, strategies based on heuristics will be addressed as, e.g., relax-and-fix, fix-and-opti…
(Only some records are available in English at this moment)
| 1 / 1 | Ongoing grants |
| 5 / 5 | Completed research grants |
| 3 / 3 | Ongoing scholarships in Brazil |
| 14 / 9 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 9 / 9 | Completed scholarships abroad |
| 33 / 28 | All research grants and scholarships |
| Associated processes | |
CV Lattes
ORCID