首页> 外文期刊>European Journal of Operational Research >Maximizing the expected net present value of a project with phase-type distributed activity durations: An efficient globally optimal solution procedure
【24h】

Maximizing the expected net present value of a project with phase-type distributed activity durations: An efficient globally optimal solution procedure

机译:通过相位类型的分布式活动持续时间最大化项目的预期净现值:有效的全球最佳解决方案程序

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

摘要

We study projects with activities that have stochastic durations that are modeled using phase-type distributions. Intermediate cash flows are incurred during the execution of the project. Upon completion of all project activities a payoff is obtained. Because activity durations are stochastic, activity starting times cannot be defined at the start of the project. Instead, we have to rely on a policy to schedule activities during the execution of the project. The optimal policy schedules activities such that the expected net present value of the project is maximized. We determine the optimal policy using a new continuous-time Markov chain and a backward stochastic dynamic program. Although the new continuous-time Markov chain allows to drastically reduce memory requirements (when compared to existing methods), it also allows activities to be preempted; an assumption that is not always desirable. We prove, however, that it is globally optimal not to preempt activities if cash flows are incurred at the start of an activity. Moreover, this proof holds regardless of the duration distribution of the activities. A computational experiment shows that we significantly outperform current state-of-the-art procedures. On average, we improve computational efficiency by a factor of 600, and reduce memory requirements by a factor of 321. (C) 2017 Elsevier B.V. All rights reserved.
机译:我们研究了具有使用相位类型分布建模的随机持续的活动的项目。在执行项目期间发生中间现金流量。完成所有项目活动后,获得了收益。由于活动持续时间是随机的,因此无法在项目的开始时定义活动启动时间。相反,我们必须依靠政策在执行项目期间安排活动。最佳策略调度活动,使得项目的预期净现值最大。我们使用新的连续时间马尔可夫链和向后随机动态程序确定最佳策略。虽然新的连续时间马尔可夫链允许大大降低内存要求(与现有方法相比),但它还允许抢占活动;假设并不总是可取的。但是,我们证明,如果在活动开始时发生现金流量,它是全球最佳的不适合抢先活动。此外,无论活动的持续时间分布如何,这种证明都具有。计算实验表明,我们显着优于最新的最先进程序。平均而言,我们将计算效率提高了600倍,并将内存要求降低了321倍。(c)2017 Elsevier B.v.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号