A task scheduling problem is a process of assigning tasks to a limited set of resources available in a time interval, where certain criteria are optimized. In this way, the sequencing of tasks is directly associated with the executability and optimality of a preset plan and can be found in a wide range of applications, such as: programming flight dispatch at airports, programming production lines in a factory, programming of surgeries in a hospital, repair of equipment or machinery in a workshop, among others. The objective of this study is to analyze the effect of the inclusion of several restrictions that negatively influence the production programming in a real manufacturing environment. For this purpose, an efficient Genetic Algorithm combined with a Local Search of Variable Neighborhood for problems of n tasks and m machines is introduced, minimizing the time of total completion of the tasks. The computational experiments carried out on a set of problem instances with different sizes of complexity show that the proposed hybrid metaheuristics achieves high quality solutions compared to the reported optimal cases.
CITATION STYLE
Viloria, A., Sierra, D. M., Duran, S. E., Rambal, E. P., Hernández-Palma, H., Ventura, J. M., … Torres, L. J. J. (2020). Optimization of Flow Shop Scheduling Through a Hybrid Genetic Algorithm for Manufacturing Companies. In Advances in Intelligent Systems and Computing (Vol. 1039, pp. 20–29). Springer. https://doi.org/10.1007/978-3-030-30465-2_3
Mendeley helps you to discover research relevant for your work.