A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept
A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept
复制标题
DOI：
10.1016/j.ejor.2005.09.018
复制
发表时间：
2007-01
期刊：
影响因子：
--
通讯作者：
M. Rabbani;S. Ghomi;F. Jolai;N. S. Lahiji
中科院分区：
文献类型：
--
作者：
M. Rabbani;S. Ghomi;F. Jolai;N. S. Lahiji
本文将新的资源管理方法与传统的资源管理方法相结合，提出了一种随机网络环境下资源受限的项目调度方法。在每个项目中，活动消耗各种类型的资源，具有固定的能力。每个活动的持续时间是具有给定密度函数的随机变量。由于反向传递方法是用于馈入资源的。问题是确定每个活动的结束时间而不是开始时间。所提出的模型的目标被定义为最小化的预期项目工期及其方差的乘积。活动完成时间的值在决策点确定，此时至少有一个活动已准备就绪，并且有可用资源。如果在某个时间点，一个以上的活动准备好运行，但缺乏可用的资源，在准备好的活动之间进行竞争，以选择必须首先运行的活动。本文提出了一种竞争惯例，通过实施一项政策，以最大限度地减少预期项目工期及其方差的总贡献的选择活动。在这方面，一个启发式算法的开发和比较与其他现有的方法。
This paper presents a newly developed resource-constrained project scheduling method in stochastic networks by merging the new and traditional resource management methods. In each project, the activities consume various types of resources with fixed capacities. The duration of each activity is a random variable with a given density function. Since the backward pass method is implemented for feeding-in resources. The problem is to determine the finish time of each activity instead of its start time. The objective of the presented model is defined as minimizing the multiplication of expected project duration and its variance. The values of activities finish times are determined at decision points when at least one activity is ready to be operated and there are available resources. If at a certain point of time, more than one activity is ready to be operated but available resources are lacking, a competition among ready activities is carried out in order to select the activities which must be operated first. This paper suggests a competition routine by implementing a policy to maximize the total contribution of selected activities in reducing the expected project duration and its variance. In this respect, a heuristic algorithm is developed and compared with the other existing methods.