Abstract: For machine paths and the workshop, a new algorithm for modeling of multiple flexible-shops is proposed, SOA-BMO. Combining the SOA principles to solve the problem of discrete optimization with the BMO mating principle generated by the four strategies, SOA and BMO ensure the diversity and avoid premature convergence. Considered the three multi-shop scheduling problems as an example for Gantt chart, the feasibility and effectiveness of the method are verified. Results show that this method has a great success to assign work-piece processing workshop and the reasonable planning work-piece path.

Key words: Surrogate Optimization Algorithm（SOA）, Bird Mating Optimizer（BMO）, multiple flexible-shops, Gantt chart

摘要： 针对加工路径和加工车间，提出一种基于SOA和BMO的柔性分层次车间调度优化问题。通过结合SOA中解决离散型优化问题的原则和BMO中由四种策略产生子代的交配原则，保证了该方法的多样性并避免了过早收敛。通过以3个柔性多车间的调度优化问题为例给出甘特图，验证了该方法的有效性和可行性。实验结果表明：该方法能够很好地分配工件的加工车间，并能合理地规划工件的加工路径。

关键词: 代理优化算法（SOA）, 鸟交配优化器（BMO）, 柔性分层次车间调度, 甘特图