Examinando por Materia "Frente de Pareto"
Mostrando1 - 2 de 2
Resultados por página
Opciones de clasificación
- PublicaciónAcceso abiertoAsistencia de investigación: Herramienta computacional con enfoque paretiano para minimizar el makespan y la tardanza máxima en el problema de scheduling Job-shop Flexible(Universidad de Ibagué, 2019) Lozada Rueda, Juan Sebastian; García León, Andrés AlbertoIn 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).
- PublicaciónRestringidoHeuristica paretiana para optimizar criterios regulares adaptables a las configuraciones flexibles en el Tolima. Caso graficajas.(Universidad de Ibagué, 2018) Santos Monedero, Ivan; García León, Andrés Alberto