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 developed and their computational performances will be analyzed. The project also aims the continuity of 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. We intend to intensify cooperation between the productive sector and academia, with the development of case studies in companies. We hope thereby enable collaborations and partnerships in the study of these problems and the development of computational tools for use in practice. The team of this project is composed by several researchers in various stages of their academic careers, from graduate students and young doctors up to experienced researchers in the study of these problems. We point out that this project is a follow up of two previous FAPESP thematic projects, the first developed between 2006 and 2010, and the second, between 2010 and 2015. In the previous projects we mainly studied problems (A), (B), (C), (D) and some integration of these problems. (AU)
Articles published in Agência FAPESP Newsletter about the research grant:
FERNANDES, CRISTINA G.;
FERREIRA, CARLOS E.;
MIYAZAWA, FLAVIO K.;
Prices of Anarchy of Selfish 2D Bin Packing Games.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE,
Web of Science Citations: 0.