Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems

•A mathematical model of flexible job-shop scheduling problem is constructed.•Reassembling schedule, intersecting schedule and inserting schedule are proposed.•A hybrid artificial bee colony algorithm with Tabu search is proposed.

This study mainly focuses on flexible job shop scheduling problems (FJSSPs) in a modern manufacturing enterprise that presents a number of different emergencies, such as new jobs inserted, old jobs cancelled, machinery breakdowns. A feasible mathematical model based on a rescheduling strategy has been constructed as an effective solution. The rescheduling strategy is illustrated by three types of scheduling: reassembling scheduling, intersecting scheduling and inserting scheduling. The objective function is to minimize the maximum completion time (makespan). A hybrid artificial bee colony algorithm (HABC) based on Tabu search (TS) has been developed to solve the model, and a cluster grouping roulette method is proposed to better initialize the population. A crossover operator is introduced for employed bees to improve the exploitation feature. Comparative experiments with other published algorithms have been conducted on well-known benchmark instances, and the analysis results show that the HABC algorithm is efficient and effective. In addition, the proposed algorithm is applied to solve actual FJSSPs in a textile machinery manufacturing enterprise.