Ir directamente a la navegación principal Ir directamente a la búsqueda Ir directamente al contenido principal

Ant colony optimization algorithm to minimize makespan and number of tardy jobs in flexible flowshop systems

  • Universidad de la Sabana

Producción científica: Capítulo del libro/informe/acta de congreso/productos no especializadosProceedingsrevisión exhaustiva

5 Citas (Scopus)

Resumen

This paper studies the problem of scheduling a set of jobs in a hybrid flowshop. Since this problem is known to be NP-hard, a meta-heuristic procedure based on Ant Colony Optimization (ACO) is proposed. The paper considers the multi-objective problem of minimizing both the makespan and the number of tardy jobs. An experimental study is carried out using wellknown instances from the literature. Because this is the first time in literature that these two objectives are considered simultaneously for the hybrid flowshop problem, the proposed procedure is compared with mono-objective heuristics for each optimization criterion. Experimental results show the efficiency and effectiveness of the proposed ACO algorithm.

Idioma originalInglés
Título de la publicación alojada38th Latin America Conference on Informatics, CLEI 2012 - Conference Proceedings
DOI
EstadoPublicada - 2012
Evento38th Latin America Conference on Informatics, CLEI 2012 - Medellin, Colombia
Duración: 1 oct. 20125 oct. 2012

Serie de la publicación

Nombre38th Latin America Conference on Informatics, CLEI 2012 - Conference Proceedings

Conferencia

Conferencia38th Latin America Conference on Informatics, CLEI 2012
País/TerritorioColombia
CiudadMedellin
Período1/10/125/10/12

Focos Estratégicos

  • Bioeconomía, Energías renovables y Sostenibilidad (BEES)​

Huella

Profundice en los temas de investigación de 'Ant colony optimization algorithm to minimize makespan and number of tardy jobs in flexible flowshop systems'. En conjunto forman una huella única.

Citar esto