中文摘要：

针对目标函数为最小化最大完成时间和总延迟时间的多目标置换流水车间调度问题，提出了一种改进的食物链算法。该算法在食物链算法的基础上，引入基于Pareto最优解的快速非支配性排序和个体拥挤距离计算，增强了算法的寻优性能。对OR—Library三个典型算例的优化比较表明，该算法在解的质量上明显超越NSGA—II算法。

英文摘要：

An improved food chain algorithm with multiple objectives of minimizing makespan was proposed for permutation flow shop scheduling and total tardiness. Fast non-dominated sorting and crowded distance estimation were introduced into the food chain algorithm to improve the optimization ability based on Pareto optimal solutions. Three typical OR-Library examples were selected to con- duct comparison. Numerical results show that the designed algorithm can obtain much better solu tions than NSGA-II.