CV Lattes
ORCID
Google Scholar Citations
Universidade Federal de São Carlos (UFSCAR). Centro de Ciências Exatas e de Tecnologia (CCET) (Institutional affiliation from the last research proposal) Birthplace: Brazil
He holds a degree in Civil Engineering from the State University of Campinas (1984), a master's degree in Computer Science and Computational Mathematics from the University of São Paulo (1989), a PhD in Transportation Engineering from the University of São Paulo (1992) and a postdoctoral ("livre-docência") degree in Mechanical Engineering from the University of São Paulo (1998). He developed a postdoctoral project at the Sloan School of Management at the Massachusetts Institute of Technology (1994). He is a Full Professor in the Department of Production Engineering at the Federal University of São Carlos, having joined in 1989. Before 1989, he was a freelance professional. He was Coordinator of the Postgraduate Program in Production Engineering at UFSCar from 2015 to 2018, and from 1996 to 1997. He was Coordinator of the Undergraduate Course in Production Engineering at UFSCar from 1992 to 1993. He was Editor-in-Chief of the scientific journal Pesquisa Operacional from 2011 to 2021. He was Editor-in-Chief of the scientific journal Gestão Produção from 1998 to 2001. He was honored by the Brazilian Association of Production Engineering (ABEPRO) in 2020 as "ABEPRO Senior Researcher in recognition of his contribution to the scientific community of Production Engineering". He was honored by the Brazilian Society for Operational Research (SOBRAPO) in 2018 in gratitude for the "relevant contribution given to Operational Research in Brazil". He has been a CNPq research productivity fellow (level 1A) since 2005. He was a member of the Advisory Committees (CA) of Production and Transportation Engineering of CNPq, was a member of the Triennial and Quadrennial Evaluation Committees of the Postgraduate Programs in Engineering III of CAPES, and is one of the coordinators of the Engineering I area of #8203;#8203;FAPESP. He has experience in Production Engineering with emphasis on the application of Operational Research models and methods in production and logistics systems. (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 focus of this proposal is the transfer of mathematical knowledge to other areas of science, technology and industry, through a structured research center specially tailored for this purpose. All mathematical knowledge is ultimately applicable, if not directly, through other areas of knowledge. In some areas the application of mathematics is almost immediate. However, the practical imp…
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 this research project we intend to study: (i) cutting and packing problems, (ii) lot sizing and scheduling problems, (iii) the integration between cutting and/or packing problems in (i) with the lot sizing and/or scheduling problems in (ii). This continues the research developed in a previous thematic project whose financial support ended in March 2010, in which the main subject was th…
The main subject of this thematic project is the study of Cutting and Packing Problems (CPP), which covers a large number of combinatorial optimization problems. These problems share the common feature of fitting items inside an object. This fitting, in its actual sense, can define the cutting of pieces in stock to produce the demanded items, as well as, the packing of boxes in a containe…
(Only some records are available in English at this moment)
The Vehicle Routing Problem with Time Windows and Multiple Deliverymen (VRPTWMD) is a variant of the traditional Vehicle Routing Problem with Time Windows (VRPTW). In this variant, multiple deliverymen travel with the vehicle, reducing service time at customer locations. Customers are grouped into clusters, with vehicles traveling primary routes (between clusters) and deliverymen travelin…
The Vehicle Allocation Problem (VAP) involves allocating a fleet of vehicles to meet the forecasted freight transportation demand between terminals over a finite and multi-period time horizon. The objective is to maximize the profit generated by services performed with the company's fleet, taking into account demand forecasting. In some cases, the goal is alternatively to minimize the cos…
In this project, we intend to address the vehicle routing problem with stochastic demands (VRPSD), which aims at defining a set of minimum cost routes for a vehicle fleet, in order to fulfill the demands of customers, considering that these demands are uncertain at the time of planning and, thus, can be altered during the routes' execution. The deterministic approach for this problem, in …
(Only some records are available in English at this moment)
The Vehicle Routing Problem is one of the most studied problems in Combinatorial Optimization due both to its complexity and real-world applications. The aim of this project is to study a variant of this problem - the Vehicle Routing Problem with Time Windows and Multiple Deliverymen. It will be studied considering a two-level routing process, which has never been done. This problem consi…
In this research project, we intend to investigate the integrated lot-sizing and cutting stock problem, which consists of an optimization planning problem that considers, simultaneously, the decisions related to both problems. The goal is to capture the interdependency between these decisions in order to enable economy of raw materials and reductions of production and inventory costs. New…
Distribution network planning involves decisions such as location-allocation, inventory management and transportation. These decisions belong to different decision levels, but are interconnected. Hence, they must be integrated in order to achieve an adequate service level and a minimum cost in network operations. In this doctoral project, we pretend to study strategic-tactical and tactica…
(Only some records are available in English at this moment)
This project addresses the Split Delivery Vehicle Routing Problem with Stochastic Demands (SDVRP-S). This problem involves the planning of optimal routes to fulfill a set of customers, assuming their demands are uncertain and only realized at the moment a vehicle arrives at the customer. Because split deliveries are allowed, a customer can be served by more than one vehicle, which is not …
The Vehicle Routing Problem with Time Windows and Multiple Deliverymen is a variant of the Vehicle Routing Problem in which each vehicle may carry more than one deliveryman to reduce overall service time. In this problem, customers are grouped in clusters that are served by a single stop of the vehicle. The vehicles travel from the depot to the clusters through primary routes. When a vehi…
This research project addresses a logistics network planning problem, that integrates essential activities in the supply chain management, namely facility location and transportation planning. Practical features are considered to make the problem more realistic such as security measures, different freight types, and taxes levied on the supply chain. In Brazil, there is a value-added tax w…
In this research project, we intend to investigate exact/approximate solution approaches to the integrated lot-sizing and cutting stock problem. The main goal is to study and implement solution methods, for solving the mathematical models, based on branch-and-bound procedures, decomposition approaches and/or relaxations, in order to explore the particularities of the mathematical models a…
(Only some records are available in English at this moment)
| 2 / 2 | Ongoing grants |
| 16 / 6 | Completed research grants |
| 4 / 4 | Ongoing scholarships in Brazil |
| 31 / 15 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 8 / 7 | Completed scholarships abroad |
| 62 / 35 | All research grants and scholarships |
| Associated processes | |