R&D project scheduling when activities may fail

• Main Authors: DE REYCK, Bert, LEUS, Roel
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2008
• Subjects: Project management; scheduling; risk; research and development; analysis of algorithms; computational complexity; Business Administration, Management, and Operations; Management Information Systems
• Online Access: https://ink.library.smu.edu.sg/lkcsb_research/6753; https://ink.library.smu.edu.sg/context/lkcsb_research/article/7752/viewcontent/R_D_project_scheduling_when_activities_may_fail.pdf
• Institution: Singapore Management University

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 present 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 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.