Abstract: Aiming at the hybrid flowshop group scheduling problem with unrelated parallel machines and sequence-dependent setup time,a mixed integer linear programming model for minimizing the makespan was established.Then an Enhanced Migrating Birds Optimization (EMBO) algorithm was proposed based on the characteristics of the problem.In EMBO,the three sub-problems,namely group scheduling,job scheduling within each group,and assignment of jobs on each stage were uniformly coded,and a decoding method was designed based on the idea of load balancing and improved first-come-first-served strategy.According to the coding characteristics,the different neighborhood structures and a co-optimized neighborhood solution generation strategy were proposed.Experiments with various problem scales and comparisons with other algorithms were carried out,and the results verified the efficiency and robustness of the proposed algorithm.

Key words: hybrid flowshop group scheduling, unrelated parallel machines, sequence-dependent setup time, migrating birds optimization algorithm, collaborative optimization

摘要： 针对无关并行机类型的混合流水车间成组调度问题,在考虑序列相关准备时间的情况下,以最小化最大完工时间为目标建立混合整数线性规划模型,结合问题特征提出一种改进的候鸟优化算法。算法对工件组间排序、各工件组内工件间排序、各工件组在各阶段上并行机指派3个子问题进行统一编码,基于负载均衡思想和改进的先到先得策略将染色体解码为问题的可行解;根据编码特征设计了不同的邻域搜索机制来构造邻域结构,并提出一种协同优化的邻域解生成策略。通过不同规模的数据实验和与对比算法的比较分析,验证了所提算法的高效性和稳健性。

关键词: 混合流水车间成组调度, 无关并行机, 序列相关准备时间, 候鸟优化算法, 协同优化