Examinando por Materia "Makespan"
Mostrando1 - 5 de 5
Resultados por página
Opciones de clasificación
- PublicaciónSólo datosAn Efficient Algorithm for Minimizing Regular Criteria in the Job-Shop Scheduling Multi-resource Resource Flexibility with Linear Routes(Communications in Computer and Information Science, 2020-10-08) García-León, Andrés Alberto; Torres Tapia, William FernandoThe level of publications of extensions derived from the Job-shop scheduling problem is really low. The Flexible Job-shop scheduling problem is the most studied and the minimization of the makespan is the dominant approach in the literature. The level of the customer service cannot be measured efficiently minimizing makespan, since it does not consider relevant aspects like the due date of jobs and the importance between customers. In this paper, we propose an efficient and fast local search general algorithm to minimize regular criteria in the Job-shop Scheduling Multi-resource Resource Flexibility with Linear Routes Problem “JSMRFLR”. JSMRFLR models situations in which an operation to be processed needs simultaneously several resources or machines, where each resource is selected from a given set of candidate resources. Our approach makes use of the disjunctive graph model to represent schedules or solutions and guide the search for an optimal solution by a fast estimation function. The transformation in the conjunctive graph is evaluated at swapping a critical arc ( x,y ) that affects the criterion and the reassignment of x and y separately. The efficiency of our approach is evidenced in instances of literature for the case of makespan criterion and a reference of results is proposed by the case of the total flow time, the maximum and total tardiness.
- 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ó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
- PublicaciónAcceso abiertoFormulación y validación de una heurística para minimizar el máximo tiempo de finalización en el problema de scheduling Job-shop Multi-recurso con rutas lineales.(Universidad de Ibagué, 2019) González Saavedra, Alejandro; García León, Andrés AlbertoAt present, organizations are being forced to promote structures of flexible operation that in turn cause cost reductions, which are revealed in the use of machinery, resources and labor. In this research, we introduce a problem that models real situations, which is scheduling Job-shop multi-resource with linear routes - JSFMRL, from these two sub-problems are based on local search processes: allocation and sequencing. The objective of this research is to design a computational instrument which allows to optimize the Makespan in the scheduling problem Job-shop multi-resource with linear routes - JSFMRL. This computational instrument was designed in MATLAB R2014a software; obtaining, a positive result in the decrease of the greater time of finalization or total delay of the orders (Makespan), with an average percentage of performance of the heuristic of 21.1%.
- PublicaciónRestringidoJSMST(Universidad de Ibagué, 2019-05-16) García León, Andrés Alberto; Torres Tapia, William Fernando