Parallelism and Hybridization in Differential Evolution to solve the Flexible Job Shop Scheduling Problem

• Salto, Carolina ^[1] ; Morero, Franco ; Bermúdez, Carlos
  1. [1] Universidad Nacional de La Pampa

     Universidad Nacional de La Pampa

     Argentina

     
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 20, Nº. 1, 2020 (Ejemplar dedicado a: Fifty-First Issue; e06), págs. 33-42
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Flexible Job Shop Scheduling Problem (FJSP) is one of the most challenging combinatorial optimization problems, with practical applicability in a real production environment. In this work, we propose a simple Differential Evolution (DE) algorithm to tackle this problem. To represent an FJSSP solution, a real value representation is adopted, which requires a very simple conversion mechanism to obtain a feasible schedule. Consequently, the DE algorithm still works on the continuous domain to explore the problem search space of the discrete FJSSP. Moreover, to enhance the local searchability and to balance the exploration and exploitation capabilities, a simple local search algorithm is embedded in the DE framework. Also, the parallelism of the DE operations is included to improve the efficiency of the whole algorithm. Experiment results confirm the significant improvement achieved by integrating the propositions introduced in this study. Additionally, test results show that our algorithm is competitive when compared with most existing approaches for the FJSSP.