Métodos heurísticos para el problema de asignación de trabajadores y balanceo de líneas de ensamblaje
Export citation
Abstract
Some types of distribution in assembly lines of manufacturing process begin as an assembly balancing problem of a certain type. In this work we propose two different algorithms based on two different methods to find a solution to the ALWABP (Assembly Line and Worker Assignment Balancing Problem) which is a generalization of the simple assembly line problem where workers assignment is introduced as a new problem for the balancing problem. Task times in this problem depends on each worker and in some cases one worker will not be capable of perform some task. The first method developed in this work is based on a GRASP metaheuristic combined with a VND metaheuristic as part of the first one. The second method is based on a Matheuristic combining a metaheuristic with an exact method. The experimental results shown in this paper are promising for the second model, due to the improvement obtained in the objective function value, in many of the instances evaluated of the different families. Therefore, the proposed model is competitive and efficient in comparison to previous methods found in the literature and exact approaches for this problem.