R&D project selection and scheduling with a filtered beam search approach
- 1 February 1996
- journal article
- research article
- Published by Taylor & Francis Ltd in IIE Transactions
- Vol. 28 (2), 167-176
- https://doi.org/10.1080/07408179608966262
Abstract
Models developed for selecting an optimal portfolio of R&D projects from among a pool of available projects do not generally include project scheduling as part of the selection criteria. Typically after a portfolio of projects is selected according to various selection criteria, they are subsequently scheduled. If it is not possible to schedule the selected projects through various research facilities and/or stages given the available resources, projects may be replaced with others requiring less time, or resources may be increased, which can result in a suboptimal portfolio. In this paper, project scheduling is included in the selection process, with a heuristic filtered beam search approach. Projects are selected on the basis of traditional selection criteria such as expected profits, as well as the makespan of the portfolio. The heuristic search procedure is demonstrated by an in-depth example and computational experimentation.Keywords
This publication has 28 references indexed in Scilit:
- Recent progress in modeling R&D project-selection processesIEEE Transactions on Engineering Management, 1992
- A zero-one goal programming approach for information system project selectionOmega, 1989
- The Single Machine Early/Tardy ProblemManagement Science, 1989
- Strategic evaluation and selection of R&D projectsR&D Management, 1989
- An interactive approach to R&D project selection and terminationIEEE Transactions on Engineering Management, 1988
- A flexible hierarchical model for project selection and budget allocation*R&D Management, 1985
- Allocation of research and development funds: A zero-one goal programming approachOmega, 1979
- AN ASSIGNMENT APPROACH TO CHOOSING R&D EXPERIMENTSDecision Sciences, 1977
- Comparative Analysis of R&D Investment ModelsA I I E Transactions, 1972
- Algorithms for Solving Production-Scheduling ProblemsOperations Research, 1960