A Hybrid Algorithm to Minimize Regular Criteria in the Job-shop Scheduling Problem with Maintenance Activities, Sequence Dependent and Set-up Times

Andrés A. García-León, William F. Torres Tapia

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaApplied Computer Sciences in Engineering - 7th Workshop on Engineering Applications, WEA 2020, Proceedings
EditoresJuan Carlos Figueroa-García, Fabián Steven Garay-Rairán, Germán Jairo Hernández-Pérez, Yesid Díaz-Gutierrez
EditorialSpringer Science and Business Media Deutschland GmbH
Páginas208-221
Número de páginas14
ISBN (versión impresa)9783030618339
DOI
EstadoPublicada - 2020
Evento7th Workshop on Engineering Applications, WEA 2020 - Bogota, Colombia
Duración: 7 oct 20209 oct 2020

Serie de la publicación

NombreCommunications in Computer and Information Science
Volumen1274 CCIS
ISSN (versión impresa)1865-0929
ISSN (versión digital)1865-0937

Conferencia

Conferencia7th Workshop on Engineering Applications, WEA 2020
País/TerritorioColombia
CiudadBogota
Período7/10/209/10/20

Huella

Profundice en los temas de investigación de 'A Hybrid Algorithm to Minimize Regular Criteria in the Job-shop Scheduling Problem with Maintenance Activities, Sequence Dependent and Set-up Times'. En conjunto forman una huella única.

Citar esto