Flexible Job Shop Scheduling Based on MBO with Integrated Queue Competitiveness
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
This study develops an enhanced multi-neighborhood Migratory Bird Optimization algorithm integrated with competitive mechanisms to address the high-complexity optimization demands of the Flexible Job Shop Scheduling Problem (FJSP). The proposed approach improves initial solution quality through a hybrid population initialization strategy, combining random generation, optimal processing time selection, and idle machine prioritization. Four distinct neighborhood structures are designed to explore the solution space across dual dimensions. To balance global exploration and local exploitation, a heterogeneous collaborative evolution mechanism is employed, utilizing asymmetric left mutation-driven and exchange-driven queues. Furthermore, a dynamic leader selection strategy based on a fitness-proportionate roulette wheel is introduced, incorporating dual-stage elite screening to overcome convergence limitations imposed by fixed rotation patterns. Experimental results demonstrate that the algorithm achieves superior convergence speed and solution optimality.
Fields of Study & Subjects
Scheduling and Optimization Algorithms
Metaheuristic Optimization Algorithms Research
Advanced Manufacturing and Logistics Optimization
Publication details
- Journal / source
- IEEE International Conference on Power, Electronics and Green Energy (ICPEGE)
- Pages
- 1716–1720
- Publication date
- 28 January 2026
- Language
- EN