Formulación y validación de una heurística paretiana para el problema de Scheduling Job-Shop multi-recurso con rutas lineales multi objetivo
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
The objective of this research assistance is to form a Paretian local search heuristic to reduce the time spent on the programming problem. A problem that affects industrial situations where a set of machines exists simultaneously selects a subset of them and shows an ordering operation that is organized according to a Job-shop configuration. This assistance extends the results. The research is based on the search for innovative solutions for the problem of the flexible store (García-León, 2016) and to validate the efficiency of the heuristic, 29 instances of (Dauzère-Pérès, 1998). They have been considered. For the fulfillment of the general objective, four specific objectives have been proposed. The first is to consolidate the state of the art of the multi-objective problem using heuristics. The second is to apply the quality metrics in the problem described for the flexible work shop. The third is the structure of the solution which is composed of a local search process which estimates the value of the criteria as the result of the operation. The development of a computational application. The document is divided into three chapters as follows: Chapter 1 describes and formulates the problem under study with the description of the state of the art. In Chapter 2 the guidelines for the construction of the heuristic and the description of the computational tool are given. Finally, Chapter 3 illustrates the results by using the tool.