Formulación de heurística para minimizar la tardanza total ponderada en el problema de Scheduling job-shop flexible
Portada
Citas bibliográficas
Código QR
Autores
Director
Autor corporativo
Recolector de datos
Otros/Desconocido
Director audiovisual
Editor/Compilador
Editores
Fecha
Cita bibliográfica
Título de serie/ reporte/ volumen/ colección
Es Parte de
Resumen
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 that is selected from a sub-set of the total of machines and the general objective is to design a computational tool to optimize the weighted delay, which is based on the results of the investigation of (García-León et al, 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 formulate estimation functions when moving critical operations. The second is to apply the linear programming model to the problem under study in small instances and finally to formulate the local search process. 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 & Paulli., 1998).