En la presente asistencia de investigaci?n, se estudia una de las extensiones del Job-shop y es la consideraci?n de la flexibilidad, la cual se refleja en la posibilidad de que una operaci?n puede ser procesada en una m?quina, que es seleccionada de un sub conjunto del total de m?quinas. El objetivo general es dise?ar una herramienta computacional para solucionar el problema al optimizar Makespan-Tardanza m?xima, la cual se basa en los resultados de la investigaci?n de (Garc?a-Le?n, Dauz?re-P?r?s, & Mati, 2016). La construcci?n de esta heur?stica es fundamentada en un proceso de b?squeda local y para ello se propusieron tres objetivos espec?ficos. El primer objetivo espec?fico consiste en proponer un conjunto de m?tricas para medir la calidad del frente de Pareto para el problema del Job-shop flexible multi-objetivo. El segundo es dise?ar un algoritmo para actualizar las soluciones no dominadas que se ubican en la frontera del frente, que sumado a ello no es conocido para el problema, y finalmente, la formulaci?n de estrategias de b?squeda. Para esta asistencia, no se ha considerado solucionar un problema espec?fico vinculado a alg?n proceso industrial y su alcance solo se limita a solucionar el problema en instancias de la literatura. Para calibrar los par?metros de la heur?stica, se han considerado las instancias m?s complejas de solucionar que se encuentran en la literatura cient?fica (Dauz?re-P?r?s et al., 1998).In the present research assistance, one of the Job-shop extensions is studied and it is the consideration of flexibility, which is reflected in the possibility that an operation can be processed in a machine, which is selected from a subset of the total number of machines. The general objective is to design a computational tool to solve the problem by optimizing Makespan-Maximum tardiness, which is based on the results of the research of (Garc?a-Le?n, Dauz?re-P?r?s, & Mati, 2016). The construction of this heuristic is based on a local search process and for this, three specific objectives were proposed. The first specific objective is to propose a set of metrics to measure the quality of the Pareto front for the problem of the multi-objective flexible Job-shop. The second is to design an algorithm to update the undominated solutions that are located on the frontier front, which added to it is not known for the problem, and finally, the formulation of search strategies. For this assistance, it has not been considered to solve a specific problem linked to an industrial process and its scope is only limited to solving the problem in instances of literature. To calibrate the parameters of the heuristic, the most complex instances of solving found in the scientific literature have been considered (Dauz?re-P?r?s et al., 1998).