Scholarship 11/14963-0 - Algoritmos, Heurística - BV FAPESP
Advanced search
Start date
Betweenand

Minimization of tool switches problem

Grant number: 11/14963-0
Support Opportunities:Scholarships in Brazil - Doctorate
Start date: January 01, 2012
End date: July 07, 2015
Field of knowledge:Engineering - Production Engineering - Operational Research
Principal Investigator:Horacio Hideki Yanasse
Grantee:Andreza Cristina Beezão
Host Institution: Instituto de Ciências Matemáticas e de Computação (ICMC). Universidade de São Paulo (USP). São Carlos , SP, Brazil
Associated research grant:10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings, AP.TEM
Associated scholarship(s):13/14979-9 - The minimization of tool switches problem, BE.EP.DR

Abstract

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 than the existing ones in the literature, especially exact methods. (AU)

News published in Agência FAPESP Newsletter about the scholarship:
More itemsLess items
Articles published in other media outlets ( ):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)