Table of Content

Open Access

ARTICLE

An Integer Programming Method for CPM Time-Cost Analysis

A. P. Chassiakos, C. I. Samaras, D. D. Theodorakopoulos1
Department of Civil Engineering, University of Patras, GR-26500 Patras, Greece.

Computer Modeling in Engineering & Sciences 2000, 1(4), 9-18. https://doi.org/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. The first approach leads to sub-optimal results but requires less computational effort than the second which, though, finds the optimal solution. The method has been successfully tested on a number of cases and results are presented to illustrate its application and demonstrate its merits.

Keywords

critical path method (CPM), integer programming, project planning, time-cost tradeoff

Cite This Article

Chassiakos, A. P., Samaras, C. I., Theodorakopoulos, D. D. (2000). An Integer Programming Method for CPM Time-Cost Analysis. CMES-Computer Modeling in Engineering & Sciences, 1(4), 9–18.



This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1190

    View

  • 967

    Download

  • 0

    Like

Related articles

Share Link

WeChat scan