Exact algorithm for matrix-based project planning problems

This paper proposes a new matrix-based project planning method that takes into consideration task importance or probability of completions thus determines and ranks the importance or probability of possible project scenarios and project structures. The proposed algorithm is fast, aims to select the most important project scenarios or the least cost/time demanding project structures. The algorithm is generic, can host several types of goals dictated by the characteristics of project management and as such can be the fundamental element of a project expert- and decision-making system.