Exact algorithm for matrix-based multilevel project planning problems

Abstract

Besides network planning methods matrix-based methods can also be used in project planning and scheduling. In this case either importance or probability of task completions can be described, and thus either importance or probability of possible project scenarios and project structures can be determined and ranked by their importance or probabilities. When using matrix-based project planning methods the main challenge is to select the project scenario and project structures regarding the management claims. This approach can also be applied, if a most desired/most probable project portfolio or a multi project has to be specified instead of a single project planning. In this study fast, exact algorithms are introduced in order to select the most important project scenarios or the least cost/time demanded project structures. The new algorithm is a framework algorithm, which can be a fundamental basis of a project expert system and decisionmakings.