An Improved Iterated Greedy Algorithm for Distributed Permutation Flowshop Scheduling Problem with setup times and due windows

The distributed permutation flowshop scheduling problem (DPFSP) has attracted more and more attention in recent years. However, DPFSP with sequence-dependent setup times (SDST) and due windows has not received enough attention. In this paper, we solve the problem of minimizing the sum of the total flowtime and the weighted earliness and tardiness from the due window for DPFSP with SDST. To solve this problem, we propose an improved iterated greedy (IGI) algorithm, in which an improved referenced local search algorithm with pairwise exchanges and the idle time insertion are used. The experimental results show that the proposed IGI algorithm has the best performance among the compared algorithms.