الگوریتم کلونی زنبور عسل ترکیبی با یک استراتژی بازنگری برای حل مشکلات برنامه ریزی کارگاه انعطاف پذیر

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.