Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (2)
  • Open Access

    ARTICLE

    Network Analysis for Projects with High Risk Levels in Uncertain Environments

    Mohamed Abdel-Basset1, Asmaa Atef1, Mohamed Abouhawwash2,3, Yunyoung Nam4,*, Nabil M. AbdelAziz1

    CMC-Computers, Materials & Continua, Vol.70, No.1, pp. 1281-1296, 2022, DOI:10.32604/cmc.2022.018947

    Abstract The critical path method is one of the oldest and most important techniques used for planning and scheduling projects. The main objective of project management science is to determine the critical path through a network representation of projects. The critical path through a network can be determined by many algorithms and is useful for managing, monitoring, and controlling the time and cost of an entire project. The essential problem in this case is that activity durations are uncertain; time presents considerable uncertainty because the time of an activity is not always easily or accurately estimated. This issue increases the need… More >

  • Open Access

    ARTICLE

    An Integer Programming Method for CPM Time-Cost Analysis

    A. P. Chassiakos, C. I. Samaras, D. D. Theodorakopoulos1

    CMES-Computer Modeling in Engineering & Sciences, Vol.1, No.4, pp. 9-18, 2000, DOI:10.3970/cmes.2000.001.461

    Abstract Time and cost to complete a project is an important tradeoff problem in project planning and control. Existing methods have not provided an accepted solution in terms of both accuracy and efficiency. In an attempt to improve the solution process, a method is presented for developing optimal project time-cost curves based on CPM analysis. Using activity succession information, project paths are developed and duration is calculated. Following that, duration is reduced in an optimal way employing integer programming. Two alternative formulations are proposed which lead to corresponding algorithms, a progressive duration reduction and a direct reduction to the desired level.… More >

Displaying 1-10 on page 1 of 2. Per Page