In this study. we propose an improved iterated greedy algorithm for solving the distributed permutation flowshop problem. where there is a single robot in each factory and the makespan needs to be minimized. In the problem considered. https://jalyttlers.shop/product-category/casserole-dishes/