Assembly flow shop scheduling problem with DPm → 1 layout has important applications in various manufacturing systems and has been extensively considered in single factory; however, this problem with fuzzy processing time is seldom studied in multiple factories. In this paper, fuzzy distributed assembly flow shop scheduling problem (FDAFSP) is considered, in which each factory has DPm → 1 layout, and an imperialist competitive algorithm with empire cooperation (ECICA) is developed to minimize fuzzy makespan. In ECICA, an adaptive empire cooperation between the strongest empire and the weakest empire is implemented by exchanging computing resources and search ability, historical evolution data are used and a new imperialist competition is adopted. Numerical experiments are conducted on various instances and ECICA is compared with the existing methods to test its performance. Computational results demonstrate that ECICA has promising advantages on solving FDAFSP.

中文翻译：

---

模糊分布装配流水车间调度的新帝国主义竞争算法

DPm→1布局的装配流水车间调度问题在各种制造系统中都有重要的应用，并且已经在单个工厂中得到了广泛的考虑。但是，很少在多个工厂研究带有模糊处理时间的问题。本文考虑了每家工厂的DPm→1布局的模糊分布式装配流水车间调度问题（FDAFSP），并开发了一种具有帝国合作的帝国主义竞争算法（ECICA）以最大程度地减少模糊制造期。在ECICA中，通过交换计算资源和搜索能力来实现最强帝国和最弱帝国之间的自适应帝国合作，使用历史演变数据并采用新的帝国主义竞争。在各种情况下进行了数值实验，并将ECICA与现有方法进行比较以测试其性能。计算结果表明，ECICA在解决FDAFSP方面具有可观的优势。