考虑多资源约束的非等效并行机节能调度算法  

An Energy-Saving Scheduling Algorithm for Non-identical Parallel Machines with Multi-resource Contraints

作　　者：周炳海[1] 顾佳颖 ZHOU Bing-hai;GU Jia-ying(College of Mechanical Engineering,Tongji University,Shanghai 201804,China)

机构地区：[1]同济大学机械与能源工程学院,上海201804

出　　处：《东北大学学报（自然科学版）》2019年第3期403-408,共6页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金资助项目(71471135)

摘　　要：针对瓶颈工序光刻过程中考虑能源消耗、多类型多数量的掩膜资源、换模等约束的非等效并行机调度问题,进行了改进型免疫克隆选择算法的调度方法研究.首先对问题域进行描述,以最小化总加权完成时间与能源消耗量为优化目标,建立了数学模型;在此基础上提出了一种带精英策略的多目标免疫克隆选择算法,该算法融合了非支配排序遗传算法的排序规则,并引入深度邻域搜索算子、种群更新算子以提高算法搜索性能及挖掘性能.最后,对算法进行仿真实验,结果表明该算法是有效的、可行的.A modified immune clone selection algorithm is proposed for the non-identical parallel lithography machine scheduling problem of the bottleneck process with energy consumption,changeover time and resource constraints,where multiple reticles are available for each reticle type.Firstly,the scheduling problem domain is described and mathematical programming formulations are put forward with the objective function of minimizing both the total weighted completion time and the energy consumption.Based on the model,then a modified multi-objective immune clone selection algorithm with elitist strategy is developed.In addition,the depth neighbor search and the population renewal operator are combined to the algorithm to increase and balance the exploration and exploitation ability.Finally,simulation experiments and theory analysis are carried out to evaluate the as-proposed algorithm,and the results indicate that the algorithm is valid and feasible.

关 键 词：调度 资源 能源消耗 免疫克隆选择算法 多目标 

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