Managing Technology Risk in R&D Project Planning: Optimal Timing and Parallelization of R&D Activities

An inherent characteristic of R&D projects is technological uncertainty, which may result in project failure, and time and resources spent without any tangible return. In pharmaceutical projects, for instance, stringent scientific procedures have to be followed to ensure patient safety and drug efficacy in pre-clinical and clinical tests before a medicine can be approved for production. A project consists of several stages, and may have to be terminated in any of these stages, with typically a low likelihood of success. In project planning and scheduling, 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 where an activity's failure leads to overall project termination. We formulate the problem, show that it is NP-hard and develop a branchand- bound algorithm that allows to obtain optimal solutions. We also present polynomial-time algorithms for special cases, and present a number of managerial insights for R&D project and planning, including the advantages and disadvantages of parallelization of R&D activities in different settings.

[1]  Peter B. Luh,et al.  Scheduling of design projects with uncertain number of iterations , 1999, Eur. J. Oper. Res..

[2]  Frederik Stork,et al.  Stochastic resource-constrained project scheduling , 2001 .

[3]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[4]  Vidyadhar G. Kulkarni,et al.  A classified bibliography of research on stochastic PERT networks: 1966-1987 , 1989 .

[5]  A. Mandelbaum,et al.  Getting the Most out of Your Product Development Process by , 2003 .

[6]  Boulevard de Constance Technology Selection and Commitment in New Product Development: The Role of Uncertainty and Design Flexibility , 2002 .

[7]  Rolf H. Möhring,et al.  Scheduling under Uncertainty: Bounding the Makespan Distribution , 2001, Computational Discrete Mathematics.

[8]  Arthur V. Hill,et al.  The Encyclopedia of Operations Management Terms , 2001 .

[9]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[10]  Paul S. Adler,et al.  From project to process management: an empirically-based framework for analyzing product development time , 1995 .

[11]  A. G. Lockett,et al.  Representation and Analysis of Multi-Stage Problems in R & D , 1973 .

[12]  Helmut Alt Computational Discrete Mathematics: advanced lectures , 2001 .

[13]  F. Clarke On _{_{*}()}(_{*}(), _{*}()) , 1979 .

[14]  Erik Demeulemeester,et al.  RanGen: A Random Network Generator for Activity-on-the-Node Networks , 2003, J. Sched..

[15]  Robert P. Smith,et al.  A model-based method for organizing tasks in product development , 1994 .

[16]  G. Ding Discrete optimization , 1977 .

[17]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[18]  Oliver Gassmann,et al.  Leading Pharmaceutical Innovation: Trends and Drivers for Growth in the Pharmaceutical Industry , 2004 .

[19]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[20]  V. Krishnan,et al.  Technology Selection and Commitment in New Product Development: The Role of Uncertainty and Design Flexibility , 2002, Manag. Sci..

[21]  A. A. Mastor,et al.  An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques , 1970 .

[22]  Steven D. Eppinger,et al.  A Model-Based Framework to Overlap Product Development Activities , 1997 .

[23]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[24]  Jonathan F. Bard,et al.  Parallel Funding of R&D Tasks with Probabilistic Outcomes , 1985 .

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  E. Lawler Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[27]  Abraham Mehrez,et al.  On Conducting Simultaneous Versus Sequential Engineering Activities in Risky R&D , 2001 .

[28]  R. W. Hansen,et al.  The price of innovation: new estimates of drug development costs. , 2003, Journal of health economics.

[29]  Christoph H. Loch,et al.  Project Selection Under Uncertainty: Dynamically Allocating Resources to Maximize Value , 2004 .

[30]  Jane N. Hagstrom,et al.  Computational complexity of PERT problems , 1988, Networks.

[31]  Rolf H. Möhring,et al.  Scheduling project networks with resource constraints and time windows , 1988 .

[32]  Luk N. Van Wassenhove,et al.  Limits to Concurrency , 1999 .

[33]  Christoph H. Loch,et al.  Project Selection Under Uncertainty , 2004 .

[34]  Roel Leus,et al.  The generation of stable project plans , 2004, 4OR.