Determinación del Método Óptimo de Operaciones de Ensamble Bimanual con el Algoritmo de Dijkstra (o de Caminos Mínimos)

3Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Cardona, M. J., Castrillón, O. D., & Tinoco, H. A. (2017). Determinación del Método Óptimo de Operaciones de Ensamble Bimanual con el Algoritmo de Dijkstra (o de Caminos Mínimos). Informacion Tecnologica, 28(4), 125–134. https://doi.org/10.4067/S0718-07642017000400015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free