检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:崔南方[1] 陈雪[1] 张艳[1] CUI Nanfang;CHEN Xue;ZHANG Y-an(School of Management,Huazhong University of Science and Technology,Wuhan 430074,China)
出 处:《武汉理工大学学报(信息与管理工程版)》2018年第5期568-573,共6页Journal of Wuhan University of Technology:Information & Management Engineering
基 金:国家自然科学基金项目(71271097)
摘 要:研究关键链项目调度中的资源分配算法,以提高调度计划的鲁棒性进而抵御不确定性的干扰。根据关键链项目调度的特点,提出了关键链资源分配算法(CCRA),该算法优先满足关键链活动的资源需求,并减少非关键链到关键链的资源传递,以制定鲁棒性强的资源分配计划,从而保护项目完工期。最后,通过大规模仿真实验比较了3种不同资源分配方案对关键链项目调度鲁棒性的影响,验证了CCRA算法的有效性。结果表明,合理的资源分配方案可以有效提高关键链项目调度的鲁棒性。The resource allocation algorithm in critical chain project scheduling is studied to improve the robustness of the scheduling plan against uncertainty. According to the characteristics of critical chain project scheduling, a critical chain resource allocation algorithm (CCRA) is proposed. The main idea of this algorithm is allocating resources to the critical chain activities with priority and reducing resource transmission between critical chain and non - critical chains in order to make a robust resource allocation plan and reduce the impact of uncertainties on project completion time. Finally, three resource allocation methods are compared through simulation experiments to test their effects on robustness of critical chain project scheduling and verify the effectiveness of CCRA algorithm. The results show that a reasonable resource allocation method can improve the robustness of critical chain project schedule effectively.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.185