具有平行批处理机的多目标FJSP问题研究  

Research on Multi-objective FJSP Problem with ParallelBatch Processing Machines

作　　者：宋立波 刘昶[1,2,3] 史海波[1,2,3] SONG Li-bo;LIU Chang;SHI Hai-bo(Key Laboratory of Networked Control Systems,Chinese Academy of Sciences,Shenyang Liaoning 110016,China;Shenyang Institute of Automation,Chinese Academy of Sciences,Shenyang Liaoning 110016,China;Institutes for Robotics and Intelligent Manufacturing,Chinese Academy of Sciences,Shenyang Liaoning 110016,China;University of Chinese Academy of Sciences,Beijing 100049,China)

机构地区：[1]中国科学院网络化控制系统重点实验室,辽宁沈阳110016 [2]中国科学院沈阳自动化研究所,辽宁沈阳110016 [3]中国科学院机器人与智能制造创新研究院,辽宁沈阳110016 [4]中国科学院大学,北京100049

出　　处：《计算机仿真》2024年第4期289-295,共7页Computer Simulation

基　　金：辽宁省重点研发计划项目(2020JH2/10100039)。

摘　　要：针对具有平行批处理机的多目标柔性作业车间调度问题,建立以最大完工时间、最大机器负荷和能耗为优化目标的数学模型,并提出了一种多种群MOEAD算法进行求解。算法结合了多种群策略的优势,三个子种群分别采用了WS、TE和BI三种聚合函数进行协同搜索,保持种群多样性的同时扩展了算法的搜索广度。设计了符合问题特性的进化算子和局部搜索策略,提高算法整体搜索性能。通过标准的FJSP算例和符合问题特性的实际数据,验证了所提算法的可行性与有效性。A mathematical model was established for the multi-objective flexible job shop scheduling problem with parallel batch processing machines,with maximum completion time,maximum machine load,and energy consumption as optimization objectives.A multi group MOEAD algorithm was proposed in the paper for solution.The algorithm combined the advantages of multiple-population strategies,and the three sub-populations used three aggregation functions of WS,TE and BI for collaborative search,which maintains the diversity of the population while expanding the search breadth of the algorithm.An evolutionary operator and a local search strategy were designed in line with the characteristics of the problem to improve the overall search performance of the algorithm.The feasibility and effectiveness of the proposed algorithm were verified by standard FJSP examples and actual data that meet the characteristics of the problem.

关 键 词：柔性作业车间 平行批处理机 绿色调度 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]