Examinando por Materia "Jop-Shop Flexible"
Mostrando1 - 1 de 1
Resultados por página
Opciones de clasificación
- PublicaciónAcceso abiertoFormulación de heurística para minimizar el makespan en el problema de scheduling job-shop flexible(Universidad de Ibagué, 2018) Valdés Guayara, Iván Esteban; García León, Andrés AlbertoThe modern environment obliges organizations to develop flexible operating structures and that in turn result in cost reductions, which are manifested in the use of machinery, labor and resources. In this research assistance, we present a problem that models real situations, which is the flexible scheduling Job-shop problem, in which two sub-problems must be solved: Assignment and sequencing. The first determines for an operation the machine that will be assigned to it; while for the second the order of operations on the assigned machines. The objective of this research assistance is to design a computational tool to optimize the makespan in the Flexible Job-shop scheduling problem. This tool is based mainly on the results 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 one to apply the PL model to the problem under study in small instances and finally formulate the local search process. For this assistance, it has not been considered to solve a specific problem linked to an industrial process. For the experiments, the most complex instances of solving found in the scientific literature have been considered (Dauzère-Pérès & Paulli., 1998). The document is divided into three chapters. In the first Chapter, the flexible scehduling Job-Shop problem is addressed with the definition of the criterion to be optimized (makespan). In the second Chapter, the mathematical formulation is approached to optimize criteria in the problem, in the third chapter, the local search process is d