关于车间调度优化问题的仿真与设计  

Simulation and Design of Job Shop Scheduling

作　　者：马佳[1] 

机构地区：[1]沈阳航空航天大学经济与管理学院,辽宁沈阳110136

出　　处：《计算机仿真》2015年第4期363-367,共5页Computer Simulation

基　　金：国家自然科学基金(61203368)

摘　　要：研究多目标柔性车间调度优化问题。由于传统车间调度存在局限性,造成车间多目标调度优化困难。为此,结合实际生产过程的特点和约束条件,构建了以最大完工时间、加工成本为目标函数的柔性车间调度模型,提出了多种群自适应免疫遗传算法。在初始种群中采用多个种群同时进化,能够有效保持种群的多样性;在算法中将自适应策略用于免疫操作中,提出动态自适应提取疫苗,以提高算法的执行效率,使算法更具灵活性和自适应性。仿真结果表明,改进算法对大规模复杂问题具有搜索速度快、稳定性强的特点,提高了调度的效率。This paper studies the multi objective flexible job - shop scheduling problem. For the purpose of sol- ving the deficiency of traditional job - shop scheduling problem, combined with the characteristics and constraints of the actual production process, a flexible job - shop scheduling model is constructed with the objective function of the due date satisfaction and processing costs, and a multi adaptive immune genetic algorithm is put forward. In the ini- tial population, multiple populations evolving simultaneously can effectively maintain the diversity. In the algorithm, the adaptive strategy is used in immune operation, the vaccine is extracted by dynamic adaptive strategy, and the efficiency of the algorithm is enhanced, which makes the algorithm more flexibility and adaptability. The simulation resuits show that the improved algorithm has fast search speed and strong stability, which can improve the efficiency of scheduling.

关 键 词：免疫遗传算法 多种群 自适应 柔性车间调度问题 多目标优化 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]