期刊
IIE TRANSACTIONS
卷 40, 期 4, 页码 367-384出版社
TAYLOR & FRANCIS INC
DOI: 10.1080/07408170701413944
关键词
project management; scheduling; risk; research and development; analysis of algorithms; computational complexity
An R&D project typically consists of several stages. Due to technological risks, the project may have to be terminated before completion, each stage having a specific likelihood of success. In the project planning and scheduling literature, this technological uncertainty has typically been ignored and project plans are developed only for scenarios in which the project succeeds. In this paper we examine how to schedule projects in order to maximize their expected net p resent value when the project activities have a probability of failure and when an activity's failure leads to overall project termination. We formulate the problem, show that it is NP-hard, develop a A branch-and-bound algorithm that allows us to obtain optimal solutions and provide extensive computational results. In the process, we establish a complexity result for an open problem in single-machine scheduling, namely for the discounted weighted-completion-time objective with general precedence constraints.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据