Skip to main navigation Skip to search Skip to main content

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

  • Universidad de la Sabana

Research output: Chapter in Book/Report/Conference proceedingProceedingspeer-review

5 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication38th Latin America Conference on Informatics, CLEI 2012 - Conference Proceedings
DOIs
StatePublished - 2012
Event38th Latin America Conference on Informatics, CLEI 2012 - Medellin, Colombia
Duration: 1 Oct 20125 Oct 2012

Publication series

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

Conference

Conference38th Latin America Conference on Informatics, CLEI 2012
Country/TerritoryColombia
CityMedellin
Period1/10/125/10/12

Strategic Focuses

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

Fingerprint

Dive into the research topics of 'Ant colony optimization algorithm to minimize makespan and number of tardy jobs in flexible flowshop systems'. Together they form a unique fingerprint.

Cite this