NETWORK QUALITY RATING IN PROJECT MANAGEMENT
Abstract
The article regards network project which can be represented by directed acyclic graph with restrictions ensuing from project definition. The problem of planning in project management is the comparative analysis of networks of the single project. It needs to have a project network quality rating tool to solve this problem. Article proposes the network ranking method by mathematical functional calculating numerical characteristic of a concrete graph. This functional has received by direct analysis significantly using planning heuristics in project management. Graph analysis has carried out by its representing as multi-parallel form of graph and using its cuts. Investigation has showed that operation increasing leads to a sharp increasing in complexity because of combinatorial explosion of analysis units’ number. Therefore, obtained functional has received by graph analysis of networks having no more than 6 operations. To rate networks having more than 6 operations it offers algorithm based on decomposition network to graphs having no more 6 operations. Using the algorithm and obtained functional allows you to get numerical characteristic rating quality of network having an arbitrary number of vertices.
References
[2] A Guide to the Project Management Body of Knowledge (PMBOK® Guide). Fifth Edition. Project Management Institute, Inc., USA, 2013. p. 589. Available at: http://fbs.dinus.edu/repository/docs/ajar/PMBOKGuide_5th_Ed.pdf (accessed 10.02.2019). (In Eng.)
[3] Larson C.F., Gray E.W. Project Management: Managerial Process. 5th edition. McGraw-Hill, 2011. pp. 608. (In Eng.)
[4] Mazzuto G., Bevilacqua M., Ciarapica F.R. A heuristic scheduling algorithm based on fuzzy logic and critical chain project management. International Journal of Project Organisation and Management. 2017; 9(4):303-327. (In Eng.) DOI: 10.1504/IJPOM.2017.088244
[5] Takahashi M., Induluska M., Steen J. Collaborative Research Project Networks: Knowledge Transfer at the Fuzzy Front End of Innovation. Project Management Journal. 2018; 49(4):36-52. (In Eng.) DOI: 10.1177/8756972818781630
[6] Kerr C., Ford S. Fleet planning and technology upgrade projects: supporting decision-making through visualisation. International Journal of Project Organisation and Management. 2018; 10(4):287-306. (In Eng.) DOI: 10.1504/IJPOM.2018.095294
[7] Rezvani A., Khosravi P. Identification of failure factors in large scale complex projects: an integrative framework and review of emerging themes. International Journal of Project Organisation and Management. 2019; 11(1):1-21. (In Eng.) DOI: 10.1504/IJPOM.2019.098723
[8] Browning T.R. Planning, Tracking, and Reducing a Complex Project’s Value at Risk. Project Management Journal. 2019; 50:71-85. Available at: https://www.pmi.org/learning/library/planning-tracking-reducing-complex-projects-risk-11476 (accessed 10.02.2019). (In Eng.)
[9] Creasy T., Fan Y., Johnson N. Practitioners’ preference: which project planning components offer the most promise? International Journal of Project Organisation and Management. 2017; 9(2):113-132. (In Eng.) DOI: 10.1504/IJPOM.2017.085290
[10] Bañuls V.A., Lopez C., Turoff M., Tejedor F. Predicting the Impact of Multiple Risks on Project Performance: A Scenario-Based Approach. Project Management Journal. 2017; 48(5):95-114. Available at: https://www.pmi.org/learning/library/predicting-multiple-risks-impact-on-project-performance-10923 (accessed 10.02.2019). (In Eng.)
[11] Steen J., DeFillippi R., Sydow J., Pryke S., Michelfelder I. Project and Networks: Understanding Resource Flows and Governance of Temporary Organizations with Quantitative and Qualitative Research Methods. Project Management Journal. 2018; 49(2):3-17. Available at: https://www.pmi.org/learning/library/projects-networks-11119 (accessed 10.02.2019). (In Eng.)
[12] Laursen M. Project Networks as Constellations for Value Creation. Project Management Journal. 2018; 49(2):56-70. Available at: https://www.pmi.org/learning/library/project-networks-value-creation-constellations-11117 (accessed 10.02.2019). (In Eng.)
[13] Pryke S., Badi F., Almadhoob H., Soundararaj B., Addyman S. Self-Organizing Networks in Complex Infrastructure Projects. Project Management Journal. 2018; 49(2):18-41. Available at: https://www.pmi.org/learning/library/self-organizing-networks-complex-infrastructure-projects-11116 (accessed 10.02.2019). (In Eng.)
[14] Yablonsky S.V, Introduction to Discrete Mathematics. Higher School, Moscow, 2003. pp. 384. (In Russ.)
[15] Vatutin E.I., Zotov I.V., V.S. Titov et al., Combinatorial-logic Problems of Synthesis of Separations of Parallel Logic Control Algorithms in Design of Logic Multicontrollers. Kursk State Technical University, Kursk, 2010. pp. 199. (In Russ.)
[16] Kasyanov V.N., Evstigneev V.N. Graphs in Programming: Processing, Visualization and Application. BHV-Petersburg, St. Petersburg, 2003. pp. 1104. (In Russ.)
[17] Iordansky М.А. Constructive Graph Theory and its Applications. N. Novgorod, Кirillitsa, 2016. pp. 172. Available at: https://iordanskyma.files.wordpress.com/2017/03/d0bad0bdd0b8d0b3d0b0.pdf (accessed 10.02.2019). (In Russ.)
[18] Bykova V.V., Soldatenko A.A. Optimal Routing by Landmarks in the Time-Dependent Networks. Applied Discrete Mathematics. 2017; 37:114-123. (In Russ.) DOI: 10.17223/20710410/37/10
[19] Belim S.V., Bogachenko N.F. The Check of the Correspondence of the Directed Graph to the Algebraic Lattice. Applied Discrete Mathematics. 2018; 41:54-65. (In Russ.) DOI: 10.17223/20710410/41/6
[20] Harary F. Graph Theory. Reading, MA: Addison-Wesley, 1969. (In Eng.)
[21] Baudon O., Bensmail J., Davot T., Hocquard H., Przbylo J., Senhaji M., Sopena E., Wozniak M. A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. Discrete Mathematics & Theoretical Computer Science. 2019; 21(1). Available at: https://dmtcs.episciences.org/5334 (accessed 10.02.2019). (In Eng.)
[22] Furuya M. Forbidden subgraphs for constant domination number. Discrete Mathematics & Theoretical Computer Science. 2018; 20(1). Available at: https://dmtcs.episciences.org/4548 (accessed 10.02.2019). (In Eng.)
[23] Furuya M., Matsumoto N. Forbidden subgraphs for k vertex-disjoint stars. Journal of Combinatorics. 2018; 9(4):721-738. (In Eng.) DOI: 10.4310/JOC.2018.v9.n4.a8
This work is licensed under a Creative Commons Attribution 4.0 International License.
Publication policy of the journal is based on traditional ethical principles of the Russian scientific periodicals and is built in terms of ethical norms of editors and publishers work stated in Code of Conduct and Best Practice Guidelines for Journal Editors and Code of Conduct for Journal Publishers, developed by the Committee on Publication Ethics (COPE). In the course of publishing editorial board of the journal is led by international rules for copyright protection, statutory regulations of the Russian Federation as well as international standards of publishing.
Authors publishing articles in this journal agree to the following: They retain copyright and grant the journal right of first publication of the work, which is automatically licensed under the Creative Commons Attribution License (CC BY license). Users can use, reuse and build upon the material published in this journal provided that such uses are fully attributed.
