Uso de algoritmos evolutivo para dar solución al problema de balanceo de líneas tipo II, aplicado a células de manufactura cuando se presenta ausentismo del personal

Rosa Virginia Escobar Rosado; Ulises Martínez Contreras; Mirella Parada González; Adán Valles Chávez; Arturo Woocay Prieto

doi:10.61117/ipsumtec.v5i4.153

Authors

Rosa Virginia Escobar Rosado Tecnológico Nacional de México https://orcid.org/0000-0002-3596-1974
Ulises Martínez Contreras Tecnológico Nacional de México https://orcid.org/0000-0002-1631-4448
Mirella Parada González Tecnológico Nacional de México https://orcid.org/0000-0002-8257-685X
Adán Valles Chávez Tecnológico Nacional de México https://orcid.org/0000-0002-6559-0123
Arturo Woocay Prieto Tecnológico Nacional de México https://orcid.org/0000-0001-9235-0494

DOI:

https://doi.org/10.61117/ipsumtec.v5i4.153

Keywords:

Evolutionary algorithms, P, NP-Hard, Type of balancing, Selection system, Genetic algorithms

Abstract

This article proposes an evolutionary algorithm to address production line balancing problems caused by absenteeism. Companies often face varying levels of absenteeism due to different factors, requiring supervisors to balance the production line based on their own priorities, which can impact productivity. Balancing problems are considered NP-Hard in complexity theory, divided into two types: Type 1 and Type 2. The proposed algorithm aims to solve the Type II balancing problem, improving efficiency by at least 15% compared to methods based on the supervisor’s experience. The solution provided by the algorithm can be achieved in computational time equal to or less than that reported by other researchers. The advantage of this algorithm is its speed, ease of use, and ability to provide an optimal sequence of operations based on the assigned absenteeism percentage.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

References

Ajenblit, D., & Wainwright, R. (1998). Applying genetic algorithms to the U-shaped assembly line balancing problem. IEEE International Conference on Evolutionary Computation, 96-101. DOI: https://doi.org/10.1109/ICEC.1998.699329

Goldberg, E. D. (1989). “Genetic Algorithms in Search, Optimization, and Machine Learning”. Addison Wesley, USA

Martinez, U., & Duff, W. (2004). HEURISTICA PPROACHES TO SOLVE THE U-SHAPED LINE BALANCING PROBLEM AUGMENTED BY. Proceedings Systems and Information Engineering Design Symposium. DOI: https://doi.org/10.1109/SIEDS.2004.239976

Martinez, C. U. (2015). METAHEURISTICA PPROACH TO SOLVING U-SHAPED ASSEMBLY LINE BALANCING PROBLEMS USING A RULE-BASE CODED GENETIC ALGORITHM. In partial fulfillment of the requirements For the Degree of Doctor of Philosophy.

Miralles, C., Garcia Sabater, J., Andres, C., & Cardos, M. (2007). Advantages of assembly lines in Sheltered Work Centres for Disabled. Acasestudy. Int. J. Production Economics, 187-197. DOI: https://doi.org/10.1016/j.ijpe.2007.02.023

Mutlu, O. O. (2012). An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II. Journal Italy DOI: https://doi.org/10.1016/j.cor.2012.07.010

Jackson R., J. (1956). “A computing procedure for a line balancing problem”, Management Sci. V2, n3, 261-272. DOI: https://doi.org/10.1287/mnsc.2.3.261

Driscoll, J. a. (2000). Definition and evolution of assembly line solutions. University of Surrey, England.