A hybrid iterated greedy algorithm for distributed flowshop group scheduling problem to minimize total tardiness time

In a customer-oriented environment, the total tardiness time is becoming more important as competition increases. While the distributed flow shop group scheduling problem (DFGSP) has a wide range of practical applications with the development of cellular manufacturing (CM). Therefore, for this problem, we use total tardiness time as the optimization objective. A mathematical model is constructed and a hybrid iterated greedy algorithm (HIG) is designed to increase the search ability by combining the variable neighborhood descent local search. Moreover, a reinitialization strategy is introduced to avoid falling into local optimum. Finally, the effectiveness of the algorithm is demonstrated by simulation experiments compared with four advanced algorithms.