工业工程2024，Vol.27Issue(6)：59-69,124,12.DOI:10.3969/j.issn.1007-7375.240024
共享资源约束净现值最大化多项目调度及其禁忌搜索启发式算法
Multi-project Scheduling with Shared Resource Constraints for Maximizing Net Present Value Using a Tabu Search Heuristic Algorithm
摘要
Abstract
This study investigates the multi-project scheduling problem under shared resource constraints,aiming to maximize net present value(NPV).The practical and theoretical background of the problem is introduced,while the research problem is formulated.An optimization model is established and the characteristics of this model are analyzed,furthermore,the key problem properties are refined.A tabu search(TS)heuristic algorithm is designed for solving the problem,with improvement measures proposed to enhance its efficiency.Finally,numerical experiments are conducted on randomly generated standard instances to verify the effectiveness of the algorithm,while sensitivity analysis of key parameters is performed.The conclusions drawn from the study are as follows:TS algorithm outperforms multistart iteration improvement(MSII)algorithm and random sampling(RS)algorithm,with the performance of the improved TS algorithm being the best.NPV increases with resource intensity and project deadlines,while it decreases with the resource factor.Additionally,NPV shows a monotonic increasing trend with the number of milestones,advance payment ratios,and progress payment ratios,while the discount rate negatively impacts NPV.关键词
多项目调度/净现值最大化/优化模型/禁忌搜索/共享资源Key words
multi-project scheduling/NPV maximization/optimization model/tabu search/shared resources分类
管理科学引用本文复制引用
何华,曹芳芳,何正文,王能民..共享资源约束净现值最大化多项目调度及其禁忌搜索启发式算法[J].工业工程,2024,27(6):59-69,124,12.基金项目
国家自然科学基金资助项目(72371195,71871176) （72371195,71871176）
