Research On Dynamic Scheduling Problem Of Flexible Job Shop Under The Condition Of Multi-robot Handling

In recent years,“Made in China” is transforming to “Intelligent Manufacturing in China”,and workshop scheduling is a core part of the operation of the intelligent manufacturing system.The dynamic scheduling of the production workshop can handle the dynamic disturbance events of the manufacturing workshop in time to ensure the stability of the manufacturing workshop produce.Flexible job shop is a highly concentrated manufacturing system,and the relationship between its components is extremely complicated.In paper the studied scheduling problem not only considers the constraints of process sequencing and process machine selection,but also the material transportation problem of the manufacturing workshop is being considered.The flexible job shop under the condition of robot handling is closer to today’s industrial processing environment and unexpected changes may occur frequently,such as order information changes,abnormal machine operation,processing time delays,material arrival delays,etc.are more common problems in the actual processing process,and the uncertain disturbance event in the processing handled has more practical application significance.For the dynamic scheduling problem of robot manufacturing cell with uncertain order information,this article describes in detail the processing environment and working process of the robot manufacturing cell based on the flexible job shop scheduling,establishes a mathematical model for the problem,and develops an improved Memetic Algorithm which combines Memetic Algorithm,Variable Neighborhood Search algorithm and dynamic scheduling strategy.Experiment results analysis proved the effectiveness of the algorithm and dynamic scheduling strategy.The studies of the dynamic scheduling problem of flexible job shop under the condition of multi-AGV handling.First of all,this article gives a detailed description of the flexible job shop with multi-AGV handling,and established a mathematical model based on the process sequence constraints,machine resource constraints and handling resource(AGV)constraints in the scheduling problem,and proposes an improved Memetic algorithm the aiming is maximum completion time,the improved Memetic algorithm combines the dual-resource critical path extraction graph method and the adaptive large neighborhood search algorithm.Simulation experiments prove the effectiveness of the algorithm.Next,a dynamic scheduling strategy based on the Memetic genetic algorithm is designed for the dynamic disturbance of order information changes and machine breakdown in the scheduling environment,the effectiveness,stability and robustness of the dynamic scheduling strategy are proved based on the results of simulation experiments of different scale cases.