Yuan-Zhen LiQuan-Ke PanJun-Qing LiLiang GaoM. Fatih Tasgetiren2025-10-0620212210-650210.1016/j.swevo.2021.100874http://dx.doi.org/10.1016/j.swevo.2021.100874https://gcris.yasar.edu.tr/handle/123456789/7518Distributed flow shop scheduling is a very interesting research topic. This paper studies the distributed permutation flow shop scheduling problem with mixed no-idle constraints which have important applications in practice. The optimization goal is to minimize total flowtime. A mixed-integer linear programming model is presented and an Adaptive Iterated Greedy (AIG) algorithm with the sample length changing according to the search process is designed. A restart strategy is also introduced to escape from local optima. Additionally to further improve the performance of the algorithm swap-based local search methods and acceleration algorithms for swap neighborhoods are proposed. Referenced Local Search (RLS) which shows better performance in solving scheduling problems is also used in our algorithm. In the destruction stage the job to be removed is selected according to the degree of influence on the total flowtime. In the initialization and construction phase when a job is inserted the jobs before and after the insertion position are removed and re-inserted into a better position to improve the algorithm search performance. A detailed design experiment is carried out to determine the best parameter configuration. Finally large-scale experiments show that the proposed AIG algorithm is the best-performing one among all the algorithms in comparison.EnglishScheduling, Flowshop, Distributed mixed no-idle flowshop, Iterated Greedy, Total flowtimeINVASIVE WEED OPTIMIZATION, MINIMIZING MAKESPAN, TOTAL FLOWTIME, SEARCH ALGORITHM, HEURISTICS, METAHEURISTICSArticle