Distributed Flow Shop Scheduling with Sequence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm
To meet the multi-cooperation production demand of enterprises, the distributed permutation flow shop scheduling problem (DPFSP) has become the frontier research in the field of manufacturing systems.In this garmin 67 paper, we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup times.To solve D