Uso de métodos heurísticos e branch-and-bound para otimização do layout fabril da linha de montagem de um componente automotivo na região de Curitiba

• Ano de defesa: 2013
• Autor(a) principal: Balau, Adriano Pereira
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Tecnológica Federal do Paraná; Curitiba; Programa de Pós-Graduação em Engenharia Mecânica e de Materiais
• Palavras-chave em Português: Instalações industriais - Layout; Otimização combinatória; Programação heurística; Algorítmos; Processos de fabricação - Controle de custo; Acessórios para automóveis - Indústria - Curitiba (PR) - Estudo de casos; Métodos de simulação; Engenharia mecânica; Plant layout; Combinatorial optimization; Heuristic programming; Algorithms; Manufacturing processes - Cost control; Automobile supplies industry - Curitiba (PR) - Case studies; Simulation methods; Mechanical engineering
• Link de acesso: http://repositorio.utfpr.edu.br/jspui/handle/1/842

Nowadays, the manufacturing enterprises are constantly looking for costs reduction, driven by rivalry and competition, which are strong globalization characteristics. In the Toyota Production System (OHNO, 1988), are highlighted the seven wastes which can exist in a manufacturing process and that, consequently, generate costs to the product without, however, adding value to it. Some commonly found wastes are the work-in-process (WIP), raw material or finished products flow wastes. The layout study aims to optimize the layout of facilities inside a process to minimize, among others, the materials flow. This study aims to present a real case of a huge auto parts manufacturer enterprise located in Curitiba, PR, which spends millions a year on layout changes. The object of study is the assembly line of a specifical component that this company manufactures. Using Heuristic methods, it proposes an approach for the layout optimizing of this assembly line. This approach was divided in two stages: in the first one, the cell formation problem (in order to improve the computational time, as well as the solution quality) was solved in order to associate machines to parts. In the second stage, the layout optimizing problem is solved, considering the combination of machines to parts (made in first stage). In both stages the hybrid meta-heuristics approach (tabu search), as well as the Exact method so called Branch-and-Bound (this on first stage), were tested to solve this problem. The results found on layout of facilities were quite promising.