Exact algorithm for matrix-based project planning problems

•A novel PDM matrix is proposed to model agile software development projects.•A novel EPR algorithm proposed to specify the best n probable project scenarios.•The proposed EPR algorithm specifies the best n feasible project structures.•The EPR determines how to restructure a project plan if manageme...

Full description

Saved in:
Bibliographic Details
Published inExpert systems with applications Vol. 42; no. 9; pp. 4460 - 4473
Main Author Kosztyan, Zsolt T
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.06.2015
Subjects
Online AccessGet full text
ISSN0957-4174
1873-6793
DOI10.1016/j.eswa.2015.01.066

Cover

More Information
Summary:•A novel PDM matrix is proposed to model agile software development projects.•A novel EPR algorithm proposed to specify the best n probable project scenarios.•The proposed EPR algorithm specifies the best n feasible project structures.•The EPR determines how to restructure a project plan if management claims change. 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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2015.01.066