SciELO - Scientific Electronic Library Online

 
vol.28 número4Sistema para Evaluar la Confiabilidad de Equipos Críticos en el Sector IndustrialPriorización de Riesgos Operacionales para un Proveedor de Tercera Parte Logística - 3PL índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

  • Em processo de indexaçãoCitado por Google
  • Não possue artigos similaresSimilares em SciELO
  • Em processo de indexaçãoSimilares em Google

Compartilhar


Información tecnológica

versão On-line ISSN 0718-0764

Resumo

CARDONA, María J; CASTRILLON, Omar D  e  TINOCO, Héctor A. Determination of the Optimal Method of Bimanual Assembly Operations with Dijkstra Algorithm (or Shortest Path). Inf. tecnol. [online]. 2017, vol.28, n.4, pp.125-134. ISSN 0718-0764.  http://dx.doi.org/10.4067/S0718-07642017000400015.

In this study, a numerical methodology is proposed to increase productivity through the analysis of operations in order to optimize the working method. This study belongs to the so-called methods engineering and is based on graphs and route optimization paths. A case study was designed to simulate a bimanual assembly process and test the proposed methodology. All forms of assembly were converted into graphs that were obtained from the combinations of parts and weights distance between them. The problem was solved with Dijkstra's algorithm. The optimum solution method was compared with the operation time of ten randomly selected alternatives of all possible assembly methods. The results showed significant differences between the optimal method and those selected, finding an increasing in the productivity of up to 20% with the optimal proposed method.

Palavras-chave : optimization; Dijkstra algorithm; methods engineering; bimanual assembly.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons