CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade Federal de São Paulo (UNIFESP). Campus São José dos Campos. Instituto de Ciência e Tecnologia (ICT) (Institutional affiliation from the last research proposal) Birthplace: Brazil
BS in Electrical Engineering from Instituto Tecnológico de Aeronáutica (1974), Master's degree in Systems Analysis and Applications from Instituto Nacional de Pesquisas Espaciais (1977) and Ph.D. in Operations Research/Sloan School of Management from The Massachusetts Institute of Technology (1981). Has experience in Industrial Engineering, focusing on Combinatorial Optimization, integer linear programming, cutting stock problems. (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 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)
In this project we intend to develop new formulations and methods for solving the MOSP aiming to obtain better computational performances compared to the existing models in the literature. The challenge in this research is to find or explore properties of the problem that allow reducing the space of "symmetric/equivalent/dominated" solutions that are observed in the existing models in the…
This project deals with a multi plant lot sizing problem integrated with the distribution problem. Both the problem of lot sizing, which consists of determining the size of production lots in order to optimize costs, and the problem of distribution and routing problems are difficult to solve. Solving these two problems in an integrated way becomes even more difficult task, also solve real…
In this project, we address the Minimization of Open Stacks Problem (MOSP). This problem arises in the context of manufacturing systems in which objects are cut to produce items in the face of cutting patterns. When the production of an item type begins, a stack is opened, and it is closed only after the production of the last copy of the corresponding item type. The MOSP consists of sequ…
In this project we focus the Minimization of tool switches problem (MTSP), that consists in determining a processing sequence of tasks in a flexible manufacturing machine, in order to minimize the number of tool switches required. Our goal is to study properties - new or already identified - of the MTSP, aiming the development of new solving methods that are computationally more efficient…
The problem we focus is the minimization of the maximum number of open stacks problem. This problem arises in many production settings, in particular, in industrial cutting environments. The minimization of the maximum number of open stacks problem can be formulated as an arc traversing problem in a graph. Using this graph we will attempt to develop more efficient methods to solve it. The…
In this project we focus the Minimization of tool switches problem (MTSP), thatconsists in determining a processing sequence of tasks in a flexible manufacturingmachine, in order to minimize the number of tool switches required. Our goal is tostudy properties - new or already identified - of the MTSP, aiming the developmentof new solving methods that are computationally more efficient tha…
| 1 / 1 | Ongoing grants |
| 11 / 7 | Completed research grants |
| 2 / 2 | Ongoing scholarships in Brazil |
| 6 / 3 | Completed scholarships in Brazil |
| 1 / 1 | Completed scholarships abroad |
| 21 / 14 | All research grants and scholarships |
| Associated processes | |