TY - JOUR

T1 - A two-phase simple model to determine the timing and duration of R and D project tasks

AU - Mehrez, Abraham

AU - David, Israel

PY - 1999/1/1

Y1 - 1999/1/1

N2 - The problem of determining the timing of risky R and D tasks (activities) and non-routine tasks is analysed through a simple non-linear mathematical programming model. The model ignores issues related to the flow of information gathered at each time point as a function of the amount of resources invested to this time point (see Lucas 1971, Management Science , 17 , 679-697, including his followers, and the literature on managerial economics for alternative approaches). The typical non-convex or non-concave structure of the objective function, which maximizes the expected discounted net value of the project, implies the possibility of multiple local optimal solutions. Forpracticalpurposes, theglobalsolution canbeidentified either by employing global optimization methods satisfying the K - T necessary conditions, i.e. Z (the gradient function of the objective function) 0, or by enumerating the objective value function for, at most, four basic solutions. An illustrative example indicates that solutions establishing overlapping and non-overlapping tasks can be candidates for optimality.

AB - The problem of determining the timing of risky R and D tasks (activities) and non-routine tasks is analysed through a simple non-linear mathematical programming model. The model ignores issues related to the flow of information gathered at each time point as a function of the amount of resources invested to this time point (see Lucas 1971, Management Science , 17 , 679-697, including his followers, and the literature on managerial economics for alternative approaches). The typical non-convex or non-concave structure of the objective function, which maximizes the expected discounted net value of the project, implies the possibility of multiple local optimal solutions. Forpracticalpurposes, theglobalsolution canbeidentified either by employing global optimization methods satisfying the K - T necessary conditions, i.e. Z (the gradient function of the objective function) 0, or by enumerating the objective value function for, at most, four basic solutions. An illustrative example indicates that solutions establishing overlapping and non-overlapping tasks can be candidates for optimality.

KW - Concurrent Engineering

KW - Non-linear Mathematical Problem

KW - R and D Management

UR - http://www.scopus.com/inward/record.url?scp=0032794938&partnerID=8YFLogxK

U2 - 10.1080/095372899233415

DO - 10.1080/095372899233415

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0032794938

SN - 0953-7287

VL - 10

SP - 48

EP - 53

JO - Production Planning and Control

JF - Production Planning and Control

IS - 1

ER -