中文摘要：

安排问题(PFSP ) 的排列流动商店是与强壮的工业背景安排问题的最著名、学习得好的生产之一。这篇论文论述把人工的免疫系统(AIS ) 的强壮的全球搜索能力与 extremal 的一个强壮的本地搜索能力相结合的一个新混合优化算法优化(EO ) 算法。建议算法与一个 makes 平底锅标准被用于一套基准问题。算法的性能被评估。比较结果显示这个新方法是 PFSP 的一条有效、竞争的途径。

英文摘要：

The permutation flowshop scheduling problem （PFSP） is one of the most well-known and well-studied production scheduling problems with strong industrial background. This paper presents a new hybrid optimization algorithm which combines the strong global search ability of artificial immune system （AIS） with a strong local search ability of extremal optimization （EO） algorithm. The proposed algorithm is applied to a set of benchmark problems with a makespan criterion. Performance of the algorithm is evaluated. Comparison results indicate that this new method is an effective and competitive approach to the PFSP.