一类带多资源工序的资源分配优化方法  

Resource Allocation Optimization Method with Multi-Resource Operations

作　　者：翁武燕 储诚斌 吴鹏 WENG Wuyan;CHU Chengbin;WU Peng(School of Economics and Management,Fuzhou University,Fuzhou 350108,China)

机构地区：[1]福州大学经济与管理学院,福州350108

出　　处：《计算机工程与应用》2024年第21期324-330,共7页Computer Engineering and Applications

基　　金：国家自然科学基金(71871159,71701049,71901069);国家社会科学基金(22BGL272);教育部人文社科基金一般项目(21YJA630096);福建“雏鹰计划”青年拔尖人才项目;福建省自然科学基金面上项目(2022J01075,2020J05040);福建省科技经济融合服务平台资助;中国工程院院地合作项目(2021-FJ-ZD-4)。

摘　　要：针对广泛存在于制造业和服务业等现实应用中的需要多类资源的多资源工序,提炼出一类新的带多资源工序的资源分配问题。建立了以最小化最大完工时间为目标的混合整数线性规划模型,并根据问题特征设计了改进禁忌搜索算法。在算法设计中,通过扰动策略和自适应禁忌长度避免陷入局部最优。300个不同规模仿真算例实验结果表明:在求解大规模实例中,改进禁忌搜索算法的性能表现优于CPLEX、经典禁忌搜索算法、变邻域搜索算法和遗传算法,能给出更好的资源分配方案;与CPLEX相比,目标函数值改善了3.01%。This paper addresses a resource-allocation problem from a real life application involving multi-resource operations.Such a problem arises in many practical applications manufacturing and services.A mixed integer linear programming model is established to minimize the makespan.According to the characteristics of the problem,an improved tabu search algorithm is developed.The algorithm avoids falling into local optima by a perturbation strategy and adaptive tabu length.The experimental results on 300 randomly generated instances show that the improved tabu search algorithm outperforms CPLEX,classical taboo search algorithm,variable neighborhood search algorithm,and genetic algorithm in solving large-scale instances,providing better resource allocation solutions.Compared to CPLEX,the objective function value shows an improvement of 3.01%.

关 键 词：资源分配 带多资源工序 基于资源分配的先后次序 禁忌搜索算法 

分 类 号：O224[理学—运筹学与控制论]