1. Explain Fulkerson’s rules. 2. Define optimistic time and pessimistic time. 3. What…
- User
- Explain Fulkerson’s rules.
- Define optimistic time and pessimistic time.
- What are the applications of PERT/CPM?
- Define total float and free float. Write mathematical formulae for each.
- Write the steps for backward pass computation.
- How to calculate the critical path?
- i) Explain the different phases of project-scheduling by PERT/CPM.
- Assistant
Sure, let's break down each of these points:
1. Fulkerson’s Rules
Fulkerson's rules are a set of guidelines used in project management, particularly in Critical Path Method (CPM) and Program Evaluation and Review Technique (PERT) for the numbering of events and ensuring a proper and error-free activity-on-arrow (AOA) network. The rules are as follows:
- Each activity is represented by one and only one arrow.
- Each activity must have a unique start (i-j event numbers), i.e., no two activities should have the same start and end nodes.
- Ensure that the numbering of the nodes progresses in such a way that a higher-numbered event can only be reached from a lower-numbered event.
- There should be no cycles or loops in the network.
- The j (ending event) value should always be greater than the i (starting event) value.
2. Optimistic Time and Pessimistic Time
- Optimistic Time (O): This is the shortest time in which an activity can be completed, assuming everything proceeds better than is normally expected. It represents an ideal scenario with no delays.
- Pessimistic Time (P): This is the longest time an activity might take to complete, assuming that everything goes wrong (but excluding major catastrophes). It represents the worst-case scenario.
3. Applications of PERT/CPM
PERT (Program Evaluation and Review Technique) and CPM (Critical Path Method) are used in various project management applications, including:
- Construction Projects: To schedule and manage construction timelines, resource allocation, and milestone tracking.
- Software Development: To plan, schedule, and track the development stages and timelines.
- Research and Development: To outline the stages of research activities and ensure timely completion.
- Event Planning: To ensure that events are planned and executed smoothly within the stipulated time.
- Manufacturing: To streamline production processes and ensure efficient workflow management.
4. Total Float and Free Float
-
Total Float (TF): This is the total amount of time that a project task or activity can be delayed without delaying the project completion time.
- Formula: ( \text{Total Float} = LFT - EFT ) or ( \text{Total Float} = LST - EST )
Where:
- LFT = Latest Finish Time
- EFT = Earliest Finish Time
- LST = Latest Start Time
- EST = Earliest Start Time
- Formula: ( \text{Total Float} = LFT - EFT ) or ( \text{Total Float} = LST - EST )
Where:
-
Free Float (FF): This is the amount of time that a project task can be delayed without delaying the early start of any immediately following tasks.
- Formula: ( \text{Free Float} = EST_{\text{Successor}} - EFT_{\text{Current}} )
Where:
- EST(_{\text{Successor}}) = Earliest Start Time of the successor activity.
- EFT(_{\text{Current}}) = Earliest Finish Time of the current activity.
- Formula: ( \text{Free Float} = EST_{\text{Successor}} - EFT_{\text{Current}} )
Where:
5. Steps for Backward Pass Computation
Backward pass computation is used to calculate the late start and finish times for each activity. Here are the steps:
- Start with the final event (project completion) and set its LFT (Latest Finish Time) to the project duration or its own EFT if known.
- Move backward through the network, calculating the Latest Start Time (LST) and Latest Finish Time (LFT) of each activity.
- ( \text{LST} = \text{LFT} - \text{Activity Duration} )
- At each node, the LFT of an activity is the minimum LST of activities originating from that node.
- Continue moving backward until you reach the initial node of the network.
6. Calculating the Critical Path
To calculate the critical path:
- Perform a forward pass to determine the earliest start (ES) and earliest finish (EF) times for each activity.
- Perform a backward pass to determine the latest start (LS) and latest finish (LF) times for each activity.
- Identify the critical path by finding the sequence of activities where the total float (TF) is zero.
- Critical Path = the longest path through the network which determines the minimum project duration.
- The activities on this path are those that cannot be delayed without delaying the project completion time.
7. Different Phases of Project Scheduling by PERT/CPM
i) Explanation of Different Phases:
-
Planning Phase:
- Define the project objectives and scope.
- Identify all the project tasks or activities.
- Determine the dependencies and sequence of activities.
- Develop the Work Breakdown Structure (WBS).
-
Scheduling Phase:
- Estimate the time required for each activity (optimistic, pessimistic, most likely for PERT).
- Construct the network diagram (either AOA or AON).
- Perform forward and backward pass calculations to determine ES, EF, LS, and LF.
- Identify the critical path and floats.
-
Allocation Phase:
- Allocate the necessary resources (manpower, machinery, materials) for each activity considering their availability.
-
Monitoring Phase:
- Continuously monitor the progress of the project.
- Update the PERT/CPM chart as the project progresses.
- Compare actual progress against the planned schedule to identify variances.
-
Controlling Phase:
- Implement corrective actions if there are deviations from the plan.
- Adjust the project schedule as needed to manage delays.
- Ensure project objectives are met within the time frame.
By following these structured phases, project managers can ensure effective and efficient project execution using PERT/CPM techniques.