Janis S. Neufeld

Oct 8, 2024 | fis.tu-dresden.de | Xuan He |Quan Pan |Liang Gao |Janis S. Neufeld

Distributed flowshop group scheduling problem (DFGSP) is commonly seen in modern industry. However, research works on DFGSP with total flow time criterion are rarely reported. The DFGSP consists of three coupled sub-problems, i.e., factory assignment for each group, group sequence in each factory, and job sequence within each group. A historical information-based iterated greedy algorithm (HIG) is proposed for solving the DFGSP with the objective of minimizing total flow time.