An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time

This paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other existing algorithms. the effectiveness of iga is demonstrated through comparison.