Abstract: Considering the transport time among adjacent operations, a distributed flexible flow-shop scheduling model to minimize the maximum completion time is proposed by analyzing the characteristics of actual enterprise production situation under the distributed multi-shop manufacturing environment,and an improved cuckoo algorithm is presented to solve this model. Athree-layer encoding scheme based on operation, factory and machine is designed, a hybrid population initialization strategy is proposed to improve the quality of population in terms of the characteristic of this problem, a search operator of cuckoo is modified for solving the proposed model and a population evolution strategy is designed to enhance the rate of convergence and the quality of solution. At the last,asimulationexperiment is carried out to verify the effectiveness and superiority of the algorithm by comparing others.

Key words: distributed flexible flow-shop, cuckoo algorithm, three-layers encoding scheme, transport time

摘要： 针对分布式制造环境下多车间调度问题特点,结合企业实际生产情况,考虑相邻工序间的运输时间,建立以最小化最大完工时间为优化目标的分布式柔性流水车间调度模型,提出一种改进布谷鸟算法用于求解该模型。算法改进包括设计了一种基于工序、车间和机器的三层编码方案;根据问题特点设计了混合种群初始化策略以提高种群质量;改进了布谷鸟搜索操作使其适用于求解该模型;设计了一种种群进化策略以提高算法收敛速度及解的质量。最后通过仿真实验,与多种算法对比,验证所提算法的有效性和优越性。

关键词: 分布式柔性流水车间, 布谷鸟算法, 三层编码方案, 运输时间