Solving hybrid flow-shop scheduling based on improved multi-objective artificial bee colony algorithm

摘要

In the model of hybrid flow shop scheduling problem with unrelated parallel machines, the makespan, total weighted earliness/tardiness and total waiting time are established as evaluation index. An algorithm of artificial bee colony based on the method of adaptive neighborhood search is designed. According to the characteristics of the model, initial processing sequence is used as solution vector in order to narrow down feasible solutions. Fitness of populations is distinguished by non-dominated sorting. In the process of iteration, excellent individuals are retained so that the diversity of population distribution is increased. Finally, the method is applied to a simulation example, compared with the traditional multi-objective algorithm. The results obtained demonstrate that the improved ABC algorithm for hybrid flow shop scheduling problem is good effective and diversified.