A heuristic scheduling algorithm for improving the duration and net present value of a project
A heuristic scheduling algorithm for improving the duration and net present value of a project
复制标题
DOI：
10.1108/01443579510077241
复制
发表时间：
1995
影响因子：
9.9
通讯作者：
G. Ulusoy;L. Özdamar
中科院分区：
文献类型：
--
作者：
G. Ulusoy;L. Özdamar
针对资源受限的项目调度问题，提出了一种启发式迭代调度算法。考虑一个通用模型，其中活动由多种操作模式表示，每种操作模式由不同的活动持续时间和资源需求组成。考虑的绩效衡量标准是项目持续时间的最小化和净现值（NPV）的最大化。在假设的现金流模型中，活动支出在其开始时发生，项目付款在其完成时支付。迭代调度算法由前向/后向调度通道组成，其中连续的调度通道由更新的活动时间窗口链接。迭代算法由称为基于局部约束的分析 (LCBA) 的基于冲突的活动选择技术支持。当迭代算法的结果与由...给出的结果进行比较时，可以观察到这两个性能标准都有相当大的改进。
Proposes a heuristic iterative scheduling algorithm for the resource constrained project scheduling problem. Considers a general model where activities are represented by multiple operating modes and each operating mode is constituted of different activity durations and resource requirements. The performance measures considered are the minimization of project duration and the maximization of net present value (NPV). In the cash flow model assumed, activity expenditures take place at their start times and the project payment is made on its completion. The iterative scheduling algorithm consists of forward/ backward scheduling passes, where consecutive scheduling passes are linked by updated activity time windows. The iterative algorithm is supported by a conflict‐based activity selection technique called local constraint based analysis (LCBA). A considerable amount of improvement in both performance criteria is observed when the results of the iterative algorithm are compared with the results given by the ...