International Journal of Innovative Research in Engineering and Management
Year: 2017, Volume: 4, Issue: 5
First page : ( 749) Last page : ( 752)
Online ISSN : 2350-0557.
DOI: 10.21276/ijirem.2017.4.5.3 |
DOI URL: https://doi.org/10.21276/ijirem.2017.4.5.3
Crossref
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/by/4.0)
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
Usman Ali Khan , Syed Faizan Haider
The identification of the most important tasks becomes virtually impossible for any project that comprises hundreds of the tasks with several dozens of its dependencies, those if missed (linked with meeting the deadline) may lead to the total, project impairment or failure. The CPM (critical path method) starting as hand-drawn diagrams, during1950s was created as project management technique that keeps the Project on track till success by helping the identification of the tasks important in nature, evolving into automated software has now become an essential part of project planning scheduling, monitoring, along with controlling big or complex projects. For finding the critical path a simple algorithm has been designed in this paper. Use of the algorithm would prove to be enhancing the time management skills of the manager.
[1] S. E. Elmaghraby, “On Criticality and Sentivity in Activity Networks,” European Journal of Operational Research, vol.127, pp. 220-238, 2000.
[2] J. E. Kelley and M. R. Walker, “Critical Path Planning and Scheduling,” In: Proceedings of the Eastern Joint Computational Conference, vol. 16, pp. 160-172, 1959.
[3] C. L. Liu and H. Y. Chen, “Critical Path for an Interval Project Network,” Journal of Management Sciences in China, vol.9, no. 1, pp. 27-32, 2006.
[4] S. H. An, P. R. Jie and G. G. He, “Comprehensive Importance Measurement for Nodes within a NodeWeighted Network,” Journal of Management Sciences in China, vol. 9, no. 6, pp. 37-42, 2006.
[5] S. E. Elmaghraby, Activity Networks: Project Planning and Control by Network Models, New York: John Wiley & Sons Inc., 1977.
[7] S. E. Elmaghraby, “Activity Nets: a Guided Tour through Some Recent Developments,” European Journal of Operational Research, vol. 82, pp. 383-408, 1995.
[8] X. M. Li and J. X. Qi, “Study on Time-Scaled Network Diagram Based on the Analysis of Activity Floats,” Operations Research and Management Science, vol. 15, no. 6, pp. 28-33, 2006.
[9] X. M. Li, J. X. Qi and Z. X. Su, “The Research on Resource Leveling Based on the Analysis of Activity Floats,” Chinese Journal of Management Science, vol. 15, no. 1, pp. 47-54, 2007.
[10] D. J. Michael, J Kamburowski and M. Stallman, “On Minimum Dummy Arc Problem,” Operations Research, vol. 27, no. 2, pp. 153-168, 1993.
[11] E. L. Demeulemeester and W. S. Herrlelen, Project Scheduling, Boston: Kluwer Academic Publishers, 2002.
[12] S. E. Elmaghraby and Kamburowski, “On Project Representation and Activity Floats,” Arabian Journal of Science and Engineering, vol. 15, pp. 627-637, 1990.
[13] Quantitative Analysis For Management-7 edition by Barry Render and Ralph M. Stair, LR: Prentice Hall International, Inc
Department of IS, King Abdulaziz University, Jeddah, Saudi Arabia
No. of Downloads: 7 | No. of Views: 1037
T. Srajan Kumar , V. Indrani , D. Swaroopa .
July 2020 - Vol 7, Issue 4
Dr. K. R. Subramanian .
May 2020 - Vol 7, Issue 3
Mr. Vallabh R Pathak , Dr. Daniel Penkar, Mr. Shripad Shouche , Mr. Vinod Hange .
November 2018 - Vol 5, Issue 6