Examinando por Autor "García-León, Andrés A."
Mostrando1 - 2 de 2
Resultados por página
Opciones de clasificación
- PublicaciónSólo datosA Fast Pareto Approach to Minimize Regular Criteria in the Job-shop Scheduling Problem with Maintenance Activities, Sequence Dependent and Set-up Times(Communications in Computer and Information Science, 2020-10-08) García-León, Andrés A.; Torres Tapia, William F.In the Job-shop scheduling problem minimizing the makespan has been the dominant approach in the literature. The level of the customer service cannot be measured efficiently for this criterion, since it does not consider relevant aspects like the due date of jobs to determine the tardiness. In this paper, we propose an innovate general approach for minimizing regular criteria in the Job-shop Scheduling which adds the conditions of maintenance activities and sequence dependent set-up times considering the Pareto optimization. Our approach makes use of the disjunctive graph model to represent schedules and support the search for an optimal solution using a classical estimation function at reversing a critical arc. The search is performed by two phases: improvement and diversification. In the improvement phase, initially, a random criterion is selected to create improving moves iteratively. When it is not possible to create a move using the selected criterion, it is penalized and a new criterion is selected. The diversification phase considers feasibility conditions to escape from a local optimal. In each move the set of solutions of the front is updated. The efficiency of our approach is illustrated on instances of literature at performing three sets of criteria. The first set considers makespan and maximum tardiness. In the second ∑Ci is considered and in the third the total tardiness. As a contribution of our approach, a benchmark of results is proposed by future research.
- PublicaciónSólo datosA Hybrid Algorithm to Minimize Regular Criteria in the Job-shop Scheduling Problem with Maintenance Activities, Sequence Dependent and Set-up Times(Communications in Computer and Information Science, 2020-10-08) García-León, Andrés A.; Torres Tapia, William F.The scheduling problems have been analyzed considering that the processing time of operations is known and normally without maintenance activities and set up times between jobs. Minimizing makespan is the most studied criterion, which does not consider important aspects for measuring the customer service like the due date and the importance between customers. Besides, the few level of publications based on regular criteria have not considered the maintenance activities and sequence dependent set-up times, which affects the finalization of jobs. In this paper, we propose a hybrid approach for minimizing regular criteria in the Job-shop Scheduling problem with maintenance activities and sequence dependent set-up times. It is an ant colony Min-Max system, which is improved with a local search algorithm at increasing the neighborhood. Our approach makes use of the disjunctive graph model to represent schedules and support the search for an optimal at reversing a critical arc that affects the criterion during the improvement phase and pheromone is supplied to the arcs that solve the problem if the global optimal is gotten. In the diversification phase, a parallel search of k ants is executed considering the pheromone on the arcs to escape of a local optimal and the best ant returns to improvement step. The quality of our approach is illustrated on known instances at adding information. The superiority respect to local search process and a classic ACO is evaluated. Finally, a reference of results is proposed for various regular criteria.