Memetic Algorithm for Dynamic Joint Flexible Job Shop Scheduling with Machines and Transportation Robots

摘要

In this study, the dynamic joint scheduling problem for processing machines and transportation robots in a flexible job shop is investigated. The study aims to minimize the order completion time (makespan) of a job shop manufacturing system. Considering breakdowns, order insertion and battery charging maintenance of robots, an event-driven global rescheduling strategy is adopted. A novel memetic algorithm combining genetic algorithm and variable neighborhood search is designed to handle dynamic events and obtain a new scheduling plan. Finally, numerical experiments are conducted to test the effect of the improved operators. For successive multiple rescheduling, the effectiveness of the proposed algorithm is verified by comparing it with three other algorithms under dynamic events, and through statistical analysis, the results verify the effectiveness of the proposed algorithm.