Resumo

CASTILLO, T. A. et al. Makespan optimization in the flexible Job Shop problem with transportation constraints using Genetic Algorithms. Entre Ciencia e Ingenieria [online]. 2018, vol.12, n.24, pp.105-115. ISSN 1909-8367.  https://doi.org/10.31908/19098367.3820.

We solved the Flexible Job Shop Scheduling Problem (FJSSP) with transportation constraints in order to minimize the makespan by sequencing and assigning machines. A bibliographic review was made in order to guide the methodology to be used. From there, we approached the problem with a genetic algorithm. We validated its effectiveness by comparing the results obtained with different instances proposed in the literature. The results obtained show that the proposed genetic algorithm is efficient in the different classic Job Shop configurations tested. The algorithm is able to find very approximate solutions to the best found to date for the Flexible Job Shop Scheduling Problem with transportation constraints.

Palavras-chave : Job Shop; Flexible Job Shop; Flexible Job Shop with transportation constraints; Transportation constraints; Genetic Algorithm; GA; Metaheuristics; Makespan.

        · resumo em Português | Espanhol     · texto em Espanhol     · Espanhol ( pdf )