Advanced Precedence Diagramming

  • Miklós Hajdu
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 16)


In this chapter we introduce the so called maximal type of relationships. Maximal types of relationships were, for example, the parts of the original Method of Potential and the HMN technique, but they were not nicely treated in these early works. It was relatively hard to understand the concept, and the computational procedure was difficult. Here we present the original concept, but we slightly modify the methodology. This modification makes this section easy to understand. Constraints are also discussed in this chapter. Constraints can be used for modifying the activity early and late times without precedence relationships. This is in fact a non-network tool, which is used to modify the results gained from the calculation based on the network logic.


Critical Path Activity Duration Early Start Network Logic Precedence Relationship 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1997

Authors and Affiliations

  • Miklós Hajdu
    • 1
  1. 1.Technical University of BudapestBudapestHungary

Personalised recommendations