Distributed Flow Shop Scheduling with Sequence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm
distributed permutation flow shop, iterated greedy, local search, swapping strategy
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 paper, we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup times. To solve DPFSPs, significant developments of some metaheuristic algorithms are necessary. In this context, a simple and effective improved iterated greedy (NIG) algorithm is proposed to minimize makespan in DPFSPs. According to the features of DPFSPs, a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed algorithm. We compare the proposed algorithm with state-of-the-art algorithms, including the iterative greedy algorithm (2019), iterative greedy proposed by Ruiz and Pan (2019), discrete differential evolution algorithm (2018), discrete artificial bee colony (2018), and artificial chemical reaction optimization (2017). Simulation results show that NIG outperforms the compared algorithms.
Han, Xue; Han, Yuyan; Chen, Qingda; Li, Junqing; Sang, Hongyan; Liu, Yiping; Pan, Quanke; and Nojima, Yusuke
"Distributed Flow Shop Scheduling with Sequence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm,"
Complex System Modeling and Simulation: Vol. 1:
3, Article 3.
Available at: https://dc.tsinghuajournals.com/complex-system-modeling-and-simulation/vol1/iss3/3