Algoritmo Genético aplicado al problema de programación en procesos tecnológicos de maquinado con ambiente Flow Shop

due to the limitations of the conventional techniques of optimization, in the following work a metaheuristic one is presented based on a genetic algorithm (ga), to solve scheduling problems of type flow shop, with the objective of minimizing the time of culmination of all the works, good known as makespan. this problem, considered to be a difficult solution is typical in combinatory optimization and it is presented in workshops with technology of having schemed, where conventional machine-tools exist and different types of pieces are manufactured that have in common oneself technological route (process order). the proposed solution it was proven with classic problems published by other authors, obtaining you satisfactory results as for the quality of the opposing solutions and the time of used computation.