首页> 外文期刊>Asia-Pacific Journal of Operational Research >Critical Sequences and Resource Links Optimization in Resource-Constrained Project Scheduling
【24h】

Critical Sequences and Resource Links Optimization in Resource-Constrained Project Scheduling

机译:资源受限项目调度中的关键序列和资源链接优化

获取原文
获取原文并翻译 | 示例
           

摘要

In order to identify critical activities and critical sequences under resource availability constraints, resource dependencies need to be established. By doing this, project managers and practitioners can focus their limited energy on specific activities and paths during the execution of a project schedule, thus guaranteeing that the project gets finished on time and with the available resources. This study proposes various rules to judge the superiority or inferiority of the methods of dependencies' creation. The total number of critical sequences which is one of these rules, directly influences the degree of difficulty in controlling the whole project -a major concern for project managers. This study classifies activities in a resource-constrained project schedule on the basis of the relationships between activities and develops the basic idea behind the optimization of resource dependencies. Specifically, two mathematical models to minimize the total number of critical sequences and that of resource links through the table translation method are proposed. A computation example shows great improvement in the number of critical sequences, critical activities and resource links and gives effective results while solving the problems in the previous research. Moreover, simulations using J30, J60, and J120 instances by Kolisch highlight the high computing speed when searching for the actual minimum number of critical sequences and resource links thanks to the table translation method.
机译:为了确定在资源可用性约束下的关键活动和关键序列,需要建立资源依赖关系。通过这样做,项目经理和从业人员可以将他们有限的精力集中在执行项目进度表期间的特定活动和路径上,从而确保项目按时并使用可用资源完成。这项研究提出了各种规则来判断依赖项创建方法的优劣。这些规则之一就是关键序列的总数,直接影响控制整个项目的难度,这是项目经理的主要关注点。这项研究基于活动之间的关系,在资源受限的项目进度表中对活动进行分类,并提出了优化资源依赖关系的基本思想。具体来说,提出了两个数学模型,以通过表转换方法最小化关键序列总数和资源链接总数。算例表明,关键序列,关键活动和资源链接的数量有了很大的改善,并在解决现有研究问题的同时给出了有效的结果。此外,借助表转换方法,使用Kolisch的J30,J60和J120实例进行的仿真突出显示了在搜索关键序列和资源链接的实际最小数量时的高计算速度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号