AN ALGORITHM FOR SOLVING THE COST OPTIMIZATION PROBLEM IN PRECEDENCE DIAGRAMMING METHOD

Authors

  • M. Hajdu

Abstract

In this paper an extension is given to the original CPM problem first solved by KELLEY and VVALKER (1959) later by FULKERSON (1961) to the Precedence Diagram network (PDM). The following precedence relationships are allowed between activities: Start-to-Start-t (SSt). Finish-to-Start-t (FSt), Start-to-Finish-t, (SFt), Finish-to-Finish-t (FFt). The solution of the problem is based on network flows theory.

Keywords:

network technique, precedence diagramming, time cost trade-offs.

Citation data from Crossref and Scopus

Crossref
Scopus
Google Scholar
Europe PMC

How to Cite

Hajdu, M. “AN ALGORITHM FOR SOLVING THE COST OPTIMIZATION PROBLEM IN PRECEDENCE DIAGRAMMING METHOD”, Periodica Polytechnica Civil Engineering, 37(3), pp. 231–247, 1993.

Issue

Vol. 37 No. 3 (1993)

Section

Research Article