International Research journal of Management Science and Technology

  ISSN 2250 - 1959 (online) ISSN 2348 - 9367 (Print) New DOI : 10.32804/IRJMST

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 24    Submit Your Rating     Cite This   Download        Certificate

THE APPLICATION OF GRAPH THEORY TO SOLVING CPM AND PERT PROBLEMS IN JAVA

    2 Author(s):  MEENAKSHI KUMARI,DR. GOPAL PRASAD SINGH

Vol -  15, Issue- 8 ,         Page(s) : 20 - 24  (2024 ) DOI : https://doi.org/10.32804/IRJMST

Abstract

In project management, critical path method (CPM) and program evaluation and review technique (PERT) are essential tools for scheduling and resource allocation. This paper explores the application of graph theory to solve CPM and PERT problems within the Java programming environment.

1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall.
2. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press.

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details