Virtual Simulation-Based Optimization for Assembly Flow Shop Scheduling Using Migratory Bird Algorithm

As industrial informatization progresses, virtual simulation technologies are increasingly demonstrating their potential in industrial applications. These systems utilize various sensors to capture real-time factory data, which are then transmitted to servers via communication interfaces to construct corresponding digital models. This integration facilitates tasks such as monitoring and prediction, enabling more accurate and convenient production scheduling and forecasting. This is particularly significant for flexible or mixed-flow production modes. Bionic optimization algorithms have demonstrated strong performance in factory scheduling and operations. Centered around these algorithms, researchers have explored various strategies to enhance efficiency and optimize processes within manufacturing environments.This study introduces an efficient migratory bird optimization algorithm designed to address production scheduling challenges in an assembly shop with mold quantity constraints. The research aims to minimize the maximum completion time in a batch flow mixed assembly flow shop scheduling problem, incorporating variable batch partitioning strategies. A tailored virtual simulation framework supports this objective. The algorithm employs a two-stage encoding mechanism for batch partitioning and sequencing, adapted to the unique constraints of each production stage. To enhance the search performance of the neighborhood structure, the study identifies and analyzes optimization strategies for batch partitioning and sequencing, and incorporates an adaptive neighborhood structure adjustment strategy. A competition mechanism is also designed to enhance the algorithm's optimization efficiency. Simulation experiments of varying scales demonstrate the effectiveness of the variable batch partitioning strategy, showing a 5-6% improvement over equal batch strategies. Results across different scales and parameters confirm the robustness of the algorithm.