Atribución-NoComercial 4.0 InternacionalFrutos, MarianoTohmé, Fernando2019-06-262019-06-262012https://repositorio.unal.edu.co/handle/unal/31163Scheduling problems can be seen as multi-objective optimization problems (MOPs), involving the simultaneous satisfaction of several goals related to the optimal design, coordination and management of tasks. The complexity of the goal functions and of the combinatorial methods used to find analytical solutions to them is quite high. The search of solutions (Pareto-optima) is better served by the use of genetic algorithms (GAs). In this work we analyze the performance of NSGAII (Non-dominated Sorting Genetic Algorithm II), SPEAII (Strength Pareto Evolutionary algorithm II) and their predecessors, NSGA and SPEA, when devoted to scheduling tasks in non-standardized production activities.application/pdfspaDerechos reservados - Universidad Nacional de Colombiahttp://creativecommons.org/licenses/by-nc/4.0/Artículo de revistahttp://bdigital.unal.edu.co/21241/info:eu-repo/semantics/openAccessJob-Shop schedulingmulti-objective optimizationPareto frontiermemetic algorithmlocal search