Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12313/2228
Title: A Hybrid Algorithm to Minimize Regular Criteria in the Job-shop Scheduling Problem with Maintenance Activities, Sequence Dependent and Set-up Times
Authors: García-León, Andrés A.
Torres Tapia, William F.
Keywords: Scheduling theory
Regular criteria
Maintenance activity
Sequence dependent
Set-up times
Local search
Ant Colony optimization and Hybrid approach
Issue Date: 8-Oct-2020
Publisher: Communications in Computer and Information Science
Citation: García-León A.A., Torres Tapia W.F. (2020) A Hybrid Algorithm to Minimize Regular Criteria in the Job-shop Scheduling Problem with Maintenance Activities, Sequence Dependent and Set-up Times. In: Figueroa-García J.C., Garay-Rairán F.S., Hernández-Pérez G.J., Díaz-Gutierrez Y. (eds) Applied Computer Sciences in Engineering. WEA 2020. Communications in Computer and Information Science, vol 1274. Springer, Cham. https://doi.org/10.1007/978-3-030-61834-6_18
Abstract: 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.
URI: https://link.springer.com/chapter/10.1007%2F978-3-030-61834-6_18
ISSN: 1865-0929
Appears in Collections:Artículos

Files in This Item:
There are no files associated with this item.



Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.