Algoritmo genético aplicado a la programación en talleres de maquinado

in this paper we use the metaheuristic named genetic algorithm, for two typical variants of problems of scheduling present in a in a machine shop parts: the variant job shop and flow shop, and the minimization of the time of finalization of all the works has been selected, good known as makespan, as objective to optimize in a work schedule. this problem is considered to be a difficult solution and is typical in combinatory optimization. the results demonstrate the quality of the solutions found in correspondence with the time of used computation, when being compared with classic problems reported by other authors. the proposed representation of each chromosome generates the complete universe of feasible solutions, where it is possible to find global good values of solution and it fulfills the restrictions of the problem.