【摘要】 多项目多资源项目进度计划是一个NP难问题。应用关键链思想与方法,分析建立了一种多项目多资源进度计划模型。设计了基于混合遗传和禁忌搜索算法的模型求解算法。对遗传算法的编码、选择、交叉、变异等操作以及禁忌搜索算法的相关操作进行了讨论;并通过实例的求解,验证了关键链方法在研究多资源约束多项目问题上的有效性,以及混合遗传和禁忌搜索算法在求解该问题上的可行性。更多还原

【Abstract】 Multi-project and multi-resource project schedule is a NP-hard problem. Critical chain theory and method are applied to analyzing and constructing a model on multi-project and multi-resource project schedule. Based on that,a hybrid algorithm based on genetic algorithm and tabu search algorithm to solve the problem is designed. Genetic coding,selection,crossover and mutation and the related operations on tabu search algorithm are discussed. Based on the experiment analysis of the instance,the validity of the critical chain method in the study of multi-project and multi-resource problem is verified,as well as the feasibility of hybrid genetic algorithm and tabu search algorithm to solve the problem.更多还原