Project Management: Network Analysis & Rules for Drawing Network Diagrams
1. Fundamentals of Project Management & Network Logic
A project is a temporary endeavor undertaken to create a unique product, service, or result, bounded by definite starting and completion dates, budget constraints, and technical specifications. Network analysis represents the visual and analytical discipline of structuring complex, non-repetitive projects into interconnected work components.
- Work Breakdown Structure (WBS): The hierarchical decomposition of the total project scope into discrete, manageable work packages and activities.
- Activity: A distinct, identifiable task or operation consuming tangible time, human effort, and material resources (e.g., “Excavate Foundation”, “Pour Concrete”).
- Event (Node): A specific point in time signifying the initiation or culmination of one or more activities. Events consume neither time nor resources (e.g., “Foundation Completed”).
- Preceding Activity: An activity that must be completely finished before a subsequent activity can legally commence.
- Succeeding Activity: An activity that cannot initiate until its immediate predecessor is completely executed.
- Concurrent Activities: Independent activities that can be executed simultaneously in parallel without mutual interference, provided resources permit.
- Merge Event: A junction event where two or more converging activities terminate together.
- Burst Event: A branching event from which two or more outgoing activities originate simultaneously.
2. Mandatory Rules for Constructing Network Diagrams
To ensure mathematical validity in subsequent CPM/PERT calculations, every network diagram must strictly comply with universal topological conventions:
- Unidirectional Flow: Arrows must point strictly from left to right, reflecting the positive progression of time. Backward-facing arrows are strictly forbidden.
- Single Origin and Single Terminal: A valid network must possess exactly one initial event (source node with no incoming arrows) and exactly one terminal event (sink node with no outgoing arrows).
- Unique Activity Identification: An activity arrow extends from tail event $i$ to head event $j$. In an AOA network, no two distinct activities can share the exact same starting event and ending event.
- The Role of Dummy Activities:
- Logic Dummy: Used when activity $X$ depends on activities $A$ and $B$, but activity $Y$ depends solely on $B$. A dashed dummy arrow from the head of $B$ to the tail of $X$ isolates the dependency.
- Identity Dummy: Used when two concurrent activities $A$ and $B$ begin at the same node and both terminate at the same milestone. A dummy activity is introduced to assign unique node numbers $(i, k)$ and $(i, j)$.
- Arrow Geometry: Arrow straightness carries no temporal meaning; length does not represent activity duration. Straight or smoothly curved lines should be used, minimizing arrow crossings.
Fulkerson’s Rule & Solved Network Construction
Topological IndexingFulkerson’s I-J Numbering Algorithm
Invented by D. R. Fulkerson in 1962, this algorithm systematically assigns positive integer numbers to events such that for every directed activity $(i, j)$, the inequality $i < j$ is guaranteed:
Step 2: Delete (mentally cross out) all outgoing arrows emerging from event 1.
Step 3: In the resulting sub-network, identify all newly created events that now have no incoming arrows. Number these events sequentially: 2, 3, 4…
Step 4: Delete all outgoing arrows emerging from the newly numbered events.
Step 5: Repeat Steps 3 and 4 until the final terminal sink event is reached and indexed.
Construct a clean, valid Activity-on-Arrow (AOA) project network from the given precedence relationships. Identify where dummy activities are mandatory, and number all events according to Fulkerson’s rule.
| Activity | Description | Immediate Predecessor(s) | Duration (Days) |
|---|---|---|---|
| $A$ | Site Survey & Excavation | — (Initial) | 4 |
| $B$ | Procure Rebar & Aggregates | — (Initial) | 6 |
| $C$ | Underground Drainage | $A$ | 5 |
| $D$ | Foundation Slab Pouring | $A, B$ | 7 |
| $E$ | Pillar Framing | $B$ | 8 |
| $F$ | Superstructure Masonry | $C, D$ | 6 |
| $G$ | Roof Slab & Finishing | $E, F$ | 5 |
Algorithmic Logic & Dummy Activity Identification:
• Activity $C$ depends only on $A$.
• Activity $E$ depends only on $B$.
• But Activity $D$ depends on both $A$ and $B$.
If we directly merge the heads of $A$ and $B$ into a single event, then $C$ would erroneously become dependent on $B$, and $E$ would erroneously become dependent on $A$!
Resolution: Keep the completion of $A$ (Node 2) and the completion of $B$ (Node 3) separate. Introduce a Logic Dummy ($Dummy_1$, duration = 0) directed from Node 2 to Node 3 (or to a specialized merge node for $D$).
Event Numbering via Fulkerson’s Rule:
1. Event 1: Initial project start event. Both $A$ and $B$ emerge from Event 1.
2. Event 2: Culmination of activity $A$. Outgoing: Activity $C$ and Dummy $D_1$.
3. Event 3: Culmination of activity $B$ plus arrival of Dummy $D_1$. Outgoing: Activity $D$ and Activity $E$. (Wait! If $E$ depends only on $B$, Dummy $D_1$ must not contaminate $E$!)
Precision Correction: Event 3 marks completion of $B$. Outgoing from Event 3 is Activity $E$ and a Dummy $D_1$ pointing to Event 4 (the junction of $A$ and $B$ for $D$). Event 2 marks completion of $A$, with Activity $C$ and Dummy $D_2$ pointing to Event 4.
4. Event 4: Junction of $A$ and $B$; Activity $D$ emerges towards Event 5.
5. Event 5: Culmination of $C$ and $D$; Activity $F$ emerges towards Event 6.
6. Event 6: Terminal project completion milestone where $E$ and $F$ converge through activity $G$.
Final Activity Arc Mapping:
• Activity $A$: $(1, 2)$
• Activity $B$: $(1, 3)$
• Activity $C$: $(2, 5)$
• Dummy $D_1$: $(2, 4)$ (transfers completion of $A$ to start of $D$)
• Dummy $D_2$: $(3, 4)$ (transfers completion of $B$ to start of $D$)
• Activity $D$: $(4, 5)$
• Activity $E$: $(3, 6)$
• Activity $F$: $(5, 6)$
• Activity $G$: $(6, 7)$ (Terminal Event 7)
Every arc $(i, j)$ cleanly satisfies $i < j$, demonstrating 100% compliance with Fulkerson's rule!
3. Network Errors & Integrity Violations
During manual diagram drafting, structural errors frequently corrupt network topology. The table below outlines the three major illegal errors and their corrective remedies:
| Network Error Type | Topological Description | Mathematical Violation | Corrective Engineering Remedy |
|---|---|---|---|
| Looping (Cycling) | A closed circular path where an activity loops back to an earlier event ($2 \to 3 \to 4 \to 2$) | Creates infinite project makespan; violates directed acyclic graph (DAG) axiom | Audit activity precedence; break cyclic feedback and redirect to appropriate successor |
| Dangling | An event with incoming activities but no outgoing arrow, terminating before the project end | Leaves work packages unconnected; prevents calculation of project critical path | Connect dangling head node to downstream junction event or directly to project terminal node |
| Redundancy | Inserting a dummy activity to represent a dependency already enforced by existing serial paths | Artificially inflates network complexity and introduces redundant computational constraints | Perform transitive reduction; eliminate superfluous dummy arrows having duplicate logic |
5. Corporate Case Vignette: Infrastructure Metro Rail Project
Larsen & Toubro (L&T) Construction: Delhi Metro Phase IV Underground Corridor
During construction of the 12-kilometer underground corridor for Delhi Metro Phase IV, L&T managed over 340 interconnected civil engineering work packages, including tunnel boring machine (TBM) shaft lowering, utility diversions, diaphragm wall casting, and track slab installations. Initial planning spreadsheets suffered from ambiguous dependencies between utility clearance and tunnel excavation, leading to idle TBM machinery costing ā¹4.5 Lakhs daily.
The project management office transitioned to formal network diagramming with rigorous Fulkerson event indexing. Introducing 14 logic dummies cleanly separated surface utility handover from underground box casting. Eliminating two major dangling nodes connected ventilation shaft completions with the power sub-station critical path, enabling L&T to shave 42 days off the civil structural phase and avoiding ā¹3.2 Crores in contractual delay penalties.
6. AKTU University Examination Question Bank
Q1: What is a Dummy Activity in network analysis? Why is it used?
Model Answer: A dummy activity is an imaginary activity consuming zero time and zero resources, depicted as a dashed directed arrow. It is used for two purposes: (1) Logic Dummy: to establish unique technological precedence when tasks share partial dependencies; (2) Identity Dummy: to avoid giving identical starting and ending node numbers to two concurrent activities.
Q2: What is ‘Dangling’ and ‘Looping’ in a network diagram?
Model Answer: Dangling occurs when an intermediate event terminates abruptly without connecting to downstream activities or the final terminal event. Looping (or cycling) is an endless circular path of arrows returning to an earlier event, creating an impossible infinite project duration.
Q3: State Fulkerson’s rule for numbering the events of a project network. Given activities A to H with predecessors: A(-), B(-), C(A), D(A, B), E(B), F(C, D), G(E), H(F, G), construct the network diagram, number the events, and identify required dummies.
Exam Strategy: Write out Fulkerson’s algorithm step-by-step. Demonstrate why a dummy is required between end of A and start of D so that C remains dependent only on A. Draw the full neat network diagram, assign node numbers 1 through 7 verifying $i < j$, and label durations on arcs.
Discussion & Questions
0 CommentsAcademic insights, questions, and conceptual clarifications from students & faculty.
No questions or comments yet
Have a doubt about this topic, an exam tip, or a conceptual perspective? Start the discussion below!
Leave a Comment / Ask a Question
Your email address will not be published. Required fields are marked *