Resource title

Optimal search on a stochastic tree with an application to multi-phased RandD scheduling

Resource image

image for OpenScout resource :: Optimal search on a stochastic tree with an application to multi-phased RandD scheduling

Resource description

We consider the problem of determining a path of feasible edges from the root of a directed tree to any one of its endpoints so as to minimize the expected search cost. Each edge in the tree is characterized by an exploration cost and a feasibility probability. When an edge is explored and found infeasible, all paths using this edge become infeasible too, and other paths must be looked for. An algorithm for solving the problem is provided. The obtained solution exhibits the dynamic aspect of searches in this setting. In particular, one may encounter repeated jumping between different parts of the tree. This model was motivated by the problem of determining an optimal schedule for an RandD project presenting several options where each can be decomposed into multiple phases satisfying precedence relationships. The model's solution demonstrates that in such situations the optimal RandD schedule exhibits a parallel, adaptative structure

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://flora.insead.edu/fichiersti_wp/inseadwp1996/96-05.pdf

Resource license

Copyright INSEAD. All rights reserved