An optimization algorithm for the multi-objective flexible fuzzy job shop environment with partial flexibility based on adaptive teaching–learning considering fuzzy processing times

Production scheduling is a critical factor to enhancing productivity in manufacturing engineering and combinatorial optimization research. The complexity and dynamic nature of production systems necessitates innovative solutions. The Job Shop Flexible Programming Problem (FJSP) provides a realistic environment for production, where processing times are variable and uncertain, and multiple objectives need optimization. To solve the Multi-Objective Flexible Fuzzy Job Shop problem with partial flexibility (P-MOFfJSP), this paper proposes a hybrid metaheuristic approach that combines the Teaching–Learning-based Optimization (TLBO) algorithm with a Genetic Algorithm. The proposed algorithm of Adaptive TLBO (TLBO-A) uses two genetic operators (mutation and crossover) with an adaptive population reconfiguration strategy, ensuring solution space exploration and preventing premature convergence. We have evaluated the TLBO-A algorithm's performance on benchmark instances commonly used in programming problems with fuzzy variables. The experimental analysis indicates significant results, demonstrating that the adaptive strategy improves the search for suitable solutions. The proposed algorithm (TLBO-A) exhibits low variations (around 11%) compared to the best mono-objective heuristic for the fuzzy makespan problem, indicating its robustness. Moreover, compared with other heuristics like traditional TLBO, the variations decrease to around 1%. However, TLBO-A stands out as it aims to solve a multi-objective problem, improving the fuzzy makespan, and identifying good results on the Pareto frontier for the fuzzy average flow time, all within this low variation margin. Our contribution addresses the challenges of production scheduling in fuzzy time environments and proposes a practical hybrid metaheuristic approach. The TLBO-A algorithm shows promising results in solving the P-MOFfJSP, highlighting the potential of our proposed methodology for solving real-world production scheduling problems. © 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

• Autores: Jiménez Tovar, Mary; Acevedo-Chedid, Jaime; Ospina-Mateus, Holman; Salas-Navarro, Katherinne; Sana, Shib Sankar
• Fecha de publicación: 2023
• Institución: Universidad Tecnológica de Bolívar
• Repositorio: Repositorio Institucional UTB
• Idioma: eng
• OAI Identifier: oai:repositorio.utb.edu.co:20.500.12585/12259
• Acceso en línea: https://hdl.handle.net/20.500.12585/12259; https://doi.org/10.1007/s00500-023-08342-2
• Palabra clave: Job Shop Scheduling Problem; Makespan; Genetic Algorithm; LEMB
• Rights: openAccess
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/