A modified iterated greedy algorithm for distributed flowshop group scheduling problem

The distributed flow shop group scheduling problem (DFGSP) has a wide practical application, especially in the cellular manufacturing field. Therefore, for the above complexity of the problem, this article proposed a mathematical model of DFGSP with the makespan criterion and a modified iterated greedy algorithm (MIG), including global search and local enhancement strategies. We have done numerous experiments on 810 instances to verify the effectiveness of the proposed MIG.