摘要
针对不相关并行机调度问题,考虑不完美维修和完美维修两种预防性维修方式,建立了以最小化最大完工时间和任务总延期时间为目标的调度模型,提出了一种基于变领域搜索的改进多目标遗传算法(INSGA-Ⅱ-VNS)对其进行求解。通过不同数据集的仿真实验及算法对比,验证了所提算法的有效性和可行性。
This study addresses the unrelated parallel machine scheduling problem by considering both imperfect and perfect preventive maintenance methods.The scheduling model aims to minimize the maximum completion time and the total task delay.To tackle this problem,an improved Non-dominated Sorting Genetic AlgorithmⅡwith Various Neighborhood Search(INSGA-Ⅱ-VNS)is introduced.The proposed algorithm’s effectiveness and feasibility are validated through simulation experiments and comparative analysis with other algorithms across various datasets.
作者
周嫄
杨路达
郭钧
杜百岗
ZHOU Yuan;YANG Luda;GUO Jun;DU Baigang(School of Mechanical and Electronic Engineering,Wuhan University of Technology,Wuhan,430070,China)
