Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
Entramado
Print version ISSN 1900-3803
Abstract
LOPEZ-VARGAS, Juan Camilo and ARANGO-MARIN, Jaime Antero. Genetic algorithm for reducing the makespan in a flexible hybrid flow shop with unrelated parallel machines, and sequence-dependent setup times. Entramado [online]. 2015, vol.11, n.1, pp.250-262. ISSN 1900-3803. https://doi.org/10.18041/entramado.2015v11n1.21103.
This article proposes a simple or standard (AGS) genetic algorithm as a focus of solution to the problem of production scheduling for a flexible hybrid flow shop environment, minimizing makespan. The coding of the proposed algorithm makes it possible to obtain results with rather reasonable computation times and with a level of convergence of the makespan close to 2%, with better solutions than those of an alternative algorithm designed for the same case of production scheduling. Based on the results obtained from the testing process and on the subsequent comparative analysis, it can be concluded that, based on the most complete modeling of the actual production conditions, the genetic algorithm executes production scheduling, reducing the maximum processing time or makespan. In future work, the focus of research will be the search for other alternative production scenarios in order to increase the application of this type of tool and generate an impact on the actual business environment.
Keywords : Genetic algorithm; flexible hybrid flow shop; makespan; unrelated parallel machines; sequence-dependent setup times.