Examinando por Materia "Maximum tardiness"
Mostrando1 - 2 de 2
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).