Project Complexity Indices based on Topology Features

Authors: Amer A. Boushaala

Abstract:

The heuristic decision rules used for project scheduling will vary depending upon the project-s size, complexity, duration, personnel, and owner requirements. The concept of project complexity has received little detailed attention. The need to differentiate between easy and hard problem instances and the interest in isolating the fundamental factors that determine the computing effort required by these procedures inspired a number of researchers to develop various complexity measures. In this study, the most common measures of project complexity are presented. A new measure of project complexity is developed. The main privilege of the proposed measure is that, it considers size, shape and logic characteristics, time characteristics, resource demands and availability characteristics as well as number of critical activities and critical paths. The degree of sensitivity of the proposed measure for complexity of project networks has been tested and evaluated against the other measures of complexity of the considered fifty project networks under consideration in the current study. The developed measure showed more sensitivity to the changes in the network data and gives accurate quantified results when comparing the complexities of networks.

Keywords: Activity networks, Complexity index, Networkcomplexity measure, Network topology, Project Network.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1330399

References:

[1] L., Ireland, "Project complexity: a brief exposure to difficult situations", www.asapm.org, 10-2007.
[2] H., Elwany, M. Shouman, and M., Abou-Ali, "A new pragmatic appraisal criteria for the assessment of heuristic projects scheduling procedures", Alexandria Engineering Journal, vol. 42, No. 2, 2003.
[3] E. W. Davis, "Project network summary measures constrained resource scheduling" AIIE, vol. 7, No. 2, 1975.
[4] J., Kamburowski, D. J. Michael, and M. F.M., Stallmann, "Minimizing the complexity of an activity network", Networks, vol. 36, Issue 1, 2000.
[5] K. M. Nassar, and M. Y., Hegab, "Developing a complexity measure for project schedules", J. Constr. Engrg. and Mgmt. vol. 132, Issue 6, 2006.
[6] K. M. Nassar, and M. Y., Hegab, "Developing a complexity measure for project schedules", J. Constr. Engrg. and Mgmt. vol. 134, Issue 3, 2008.
[7] N.L. Martin, J.M. Pearson, K.A., Furumo, "IS project management: size, complexity, practices and the project management office", Proceedings of the 38th Annual Hawaii International Conference on Information systems, 2005.
[8] R. A., Kaimann, "Coefficient of network complexity", Management Science, vol. 21, No. 2, 1974.
[9] B. De Reyck and W., Herroelen, "On the use of the complexity index as a measure of complexity in activity networks", European Journal of Operational Research, vol. 91, Issue 2, 1996.
[10] M. T., Pich, C. H., Loch and A., De Meyer, "On uncertainty, ambiguity, and complexity in project management", Management Science, vol. 48, No. 8, 2002.
[11] D., Baccarini, "The concept of project complexity - a review", Intvrnational Journal of Project Management, vol. 14, No. 4, 1996.
[12] A. A., Badiru, "Towards the standardization of performance measures for project scheduling heuristics", vol. 35, No. 2, 1988.
[13] S. E. Elmaghraby, and W. S., Herroelen, "On the measurement of complexity in activity networks", European Journal of Operational Research, vol. 5, No. 1, 1980.
[14] T., Pascoe, "Allocation of resources CPM", Review of French of Operation Research, vol. 38, 1966.
[15] E. M., Davies, "An experimental investigation of resources allocation in multi-activity projects", Operational Research Quart., vol. 24, No. 4, 1974.
[16] T. J. R., Johnson, "An algorithm for the resource constrained project scheduling problem", Management Science, vol. 22, No. 11, 1974.
[17] J. H., Patterson, "Project scheduling: the effect of problem structure on heuristic performance", Noval Res. Logistics, vol. 23, No. 1, 1976.