The distributed assembly scheduling problem with a hybrid-flow shop for fabrication is seldom studied, and some real-life constraints such as factory eligibility are handled. In this study, shop-scheduling (DAHFSP) investigated, which has symmetries on machines. A shuffled frog-leaping algorithm cooperations (CSFLA) applied to minimize makespan. problem-related feature used. Memeplexes evaluate...