基于免疫克隆选择算法的混合流水车间调度问题的研究

本文针对混合流水车间调度问题，以最大流程时间最小为目标函数，建立了混合整数数学规划模型；将具有解决复杂组合优化问题的免疫克隆选择算法（ICA）应用于求解混合流水车间调度问题，详细描述了ICA算法求解HFSP问题的步骤；为了验证算法的有效性，仿真对比了遗传算法和ICA算法的性能，与文献结果比较，结果表明ICA算法求解HFSP问题可行性和有效性。

Research on Hybrid Flow-shop Scheduling Problem Based on Immune Clonal Selection Algorithm

In this paper ,the mixed-integer nonlinear programming model is established for hybrid flow-shop scheduling problem （HFSP）,with the minimum of makespan as the objective function.Clonal selction algorithm （ICA） which has the ability of solution to complex combinatorial optimization problem is applied to HFSP.The steps of solution to HFSP by ICA are presented concretely, To validate the availability of the method,the performance of genetic algorithm between ICA is compared by the simulating experimentation. Compared with the references,the experimental results indicate the availability and effectivity of ICA for solution to HFSP.