Artificial Bee Colony Algorithm Applied to Dynamic Flexible Job Shop Problems

• Autor(a) principal: Ferreira, I.
• Data de Publicação: 2020
• Outros Autores: Firme, B., Martins, M., Coito, T., Viegas, J., Figueiredo, Joao, Vieira, S., Sousa, J.
• Tipo de documento: Artigo
• Idioma: por
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10174/28823; https://doi.org/FERREIRA, I., FIRME, B., MARTINS, M., COITO, T., VIEGAS, J., FIGUEIREDO, J., VIEIRA, S. SOUSA, J. [2020] Artificial Bee Colony Algorithm Applied to Dynamic Flexible Job Shop Problems. In: Lesot MJ. et al. (eds) Information Processing and Management of Uncertainty in Knowledge-Based Systems. IPMU 2020. Communications in Computer and Information Science, vol 1237. Springer, Cham. https://doi.org/10.1007/978-3-030-50146-4_19; https://doi.org/10.1007/978-3-030-50146-4_19
• topic: Dynamic environment; New jobs arrival; Operations cancellation; Jobs cancellation; Flexible job shop rescheduling

This work introduces a scheduling technique using the Artificial Bee Colony (ABC) algorithm for static and dynamic environments. The ABC algorithm combines different initial populations and generation of new food source methods, including a moving operations technique and a local search method increasing the variable neighbourhood search that, as a result, improves the solution quality. The algorithm is validated and its performance is tested in a static environment in 9 instances of Flexible Job Shop Problem (FJSP) from Brandimarte dataset obtaining in 5 instances the best known for the instance under study and a new best known in instance mk05. The work also focus in developing tools to process the information on the factory through the development of solutions when facing disruptions and dynamic events. Three real-time events are considered on the dynamic environment: jobs cancellation, operations cancellation and new jobs arrival. Two scenarios are studied for each real-time event: the first situation considers the minimization of the disruption between the previous schedule and the new one and the second situation generates a completely new schedule after the occurrence. Summarizing, six adaptations of ABC algorithm are created to solve dynamic environment scenarios and their performances are compared with the benchmarks of two case studies outperforming both.