Publicado em: 06/07/2015

Defesa de Proposta de Tese – Leonardo de Miranda Borba

UNIVERSIDADE FEDERAL DO RIO GRANDE DO SUL
INSTITUTO DE INFORMÁTICA
PROGRAMA DE PÓS-GRADUAÇÃO EM COMPUTAÇÃO

———————————————-
DEFESA DE PROPOSTA DE TESE

Aluno: Leonardo de Miranda Borba
Orientador: Prof. Dr. Marcus Rolf Peter Ritt
Título: Heterogeneous Assembly Line Balancing Problems
Linha de Pesquisa: Fundamentos da Computação
Data: 13/07/2015
Horário: 10h
Local: Prédio 43412 – Sala 218 – sala de videoconferência, Instituto de Informática.

Banca Examinadora:
Prof. Dr. Cristóbal Miralles (UPV – Espanha) – POR VIDEOCONFERÊNCIA
Prof. Dr. Mayron César de Oliveira Moreira (UFLA)
Prof. Dr. Jordi Pereira Gude (UCN – Chile) – POR SKYPE
Prof. Dr. Luigi Carro (UFRGS)
Presidente da Banca: Prof. Dr. Marcus Rolf Peter Ritt

Resumo: The difference among workstations is assumed to be negligible in traditional assembly lines. Heterogeneous assembly lines consider the problem of industries that have different workstations taking different times to execute the same tasks. In the Assembly Line Worker Assignment and Balancing Problem (ALWABP), workers are assigned to workstations and execute the same tasks in different times. In some cases they could even be incapable of executing some tasks. In the Robotic Assembly Line Balancing Problem (RALBP) there are different types of robots and each station should be performed by some of these types of robots. The Assembly Line Design Problem (ALDP) has the same constraints as the RALBP, but instead of minimizing the number of stations or the cycle time, it aims to minimize the total cost of the line. We propose exact and heuristic methods for the type 2 of the ALWABP (ALWABP-2), that minimizes the cycle time of the line for a fixed number of stations. These methods are evaluated and shown to be competitive against state-of-the-art results. Also, the work investigates lower bounds, dominance rules and branching strategies for the RALBP and the ALDP.