SlideShare une entreprise Scribd logo
1  sur  38
Network Scheduling,
Planning & Controlling
Techniques
Introduction
 Schedule converts action plan into operating time table
 Basis for monitoring and controlling project
 Scheduling more important in projects than in production,
because unique nature
 Sometimes customer specified/approved requirement.
 Based on Work Breakdown Structure (WBS)
 Graphical portrayal of activities and event
 Shows dependency relationships between tasks/activities in a
project
 Clearly shows tasks that must precede (precedence) or follow
(succeeding) other tasks in a logical manner
 Clear representation of plan – a powerful tool for planning
and controlling project
Network
Networking Techniques
CPM GERTPERT
History Of PERT/CPM
Developed by
the US Navy for
the planning
and control of
the Polaris
missile program
The emphasis
was on
completing the
program in the
shortest possible
time.
PERT Developed by
Du Pont to solve
project
scheduling
problems
The emphasis
was on the
trade-off
between the
cost of the
project and its
overall
completion time
CPM
Why PERT/CPM?
 Prediction of deliverables
 Planning resource requirements
 Controlling resource allocation
 Internal program review
 External program review
 Performance evaluation
 Uniform wide acceptance
Applications Of PERT/CPM Techniques
1
• Construction of a Dam or Canal
• Construction of a building or highway
2
• Maintenance or Overhaul of aircrafts
• Space Flights
3
• Designing a Prototype of a Machine
• Development of Supersonic Planes
Steps in PERT/CPM
4. Controlling
3. Allocation Of Resources
2. Scheduling
1. Planning
Need of PERT/CPM
 Prediction of deliverables
 Planning resource requirements
 Controlling resource allocation
 Internal program review
 External program review
 Performance evaluation
 Uniform wide acceptance
PERT
PERT
Project Evaluation
and Review
Technique (PERT)
• U S Navy (1958) for the POLARIS
missile program
• Multiple task time estimates
(probabilistic nature)
• Activity-on-arrow network
construction
• Non-repetitive jobs (R & D work)
 PERT is based on the assumption that an activity’s duration
follows a probability distribution instead of being a single value
 Three time estimates are required to compute the parameters of
an activity’s duration distribution:
 pessimistic time (a) - the time the activity would take if things
did not go well
 most likely time (m ) - the consensus best estimate of the
activity’s duration
 optimistic time (b) - the time the activity would take if things
did go well
Mean (expected time):te = a + 4m + b
6
Variance: V =
b- a
6
2
PERT
Use of PERT
 In construction activities
 Transportation activities
 In oil refineries
 Computer system-
 For manufacturing electric generator machines
 Medical and surgical sector
 Library activities
Importance of PERT System
 Reduction in cost
 Saving of time
 Determination of activities
 Elimination of risk in complex activities –
 Flexibility
 Evaluation of alternatives-
 Useful in effective control-
 Useful in decision making
 Useful is research work
Critical path
 Those activities which contribute directly to the overall duration of the
project constitute critical activities, the critical activities form a chain
running through the network which is called critical path.
 Critical event : the slack of an event is the difference between the latest &
earliest events time. The events with zero slack time are called as critical
events.
 Critical activities : The difference between latest start time & earliest start
time of an activity will indicate amount of time by which the activity can be
delayed without affecting the total project duration. The difference is
usually called total float. Activities with 0 total float are called as critical
activities
CPM
Critical Path
Method (CPM)
• E I Du Pont de Nemours & Co. (1957)
for construction of new chemical plant
and maintenance shut-down
• Deterministic task times
• Activity-on-node network
construction
• Repetitive nature of jobs
CPM
 Path
 A connected sequence of activities leading from the starting
event to the ending event
 Critical Path
 The longest path (time); determines the project duration
 Critical Activities
 All of the activities that make up the critical path
CPM calculation
Critical path
 Those activities which contribute directly to the overall duration of the
project constitute critical activities, the critical activities form a chain
running through the network which is called critical path.
 Critical event : the slack of an event is the difference between the latest &
earliest events time. The events with zero slack time are called as critical
events.
 Critical activities : The difference between latest start time & earliest start
time of an activity will indicate amount of time by which the activity can be
delayed without affecting the total project duration. The difference is
usually called total float. Activities with 0 total float are called as critical
activities
 Useful at many stages of project management
 Mathematically simple
 Give critical path and slack time
 Provide project documentation
 Useful in monitoring costs
Benefits of CPM/PERT
 Clearly defined, independent and stable activities
 Specified precedence relationships
 Over emphasis on critical paths
 Deterministic CPM model
 Activity time estimates are subjective and depend on judgment
 PERT assumes a beta distribution for these time estimates, but
the actual distribution may be different
 PERT consistently underestimates the expected project
completion time due to alternate paths becoming critical
Limitations to CPM/PERT
Activity
Predecessor
activity
A none
B none
C A
D A
E B
F C
G D & E
1
3
2
5
4
6
A
B
C
D
E
F
G
Example
Activity
Predecessor
activity
A none
B A
C A
D B
E C
F D ,E
Example
1 2
3
4
5 6
A
B
C
D
E
F
Project Crashing
 Crashing
 reducing project time by expending additional resources
 Crash time
 an amount of time an activity is reduced
 Crash cost
 cost of reducing activity time
 Goal
 reduce project duration at minimum cost
Time-Cost Relationship
 Crashing costs increase as project duration decreases
 Indirect costs increase as project duration increases
 Reduce project length as long as crashing costs are less than
indirect costs
Time-Cost Tradeoff
time
Direct cost
Indirect
cost
Total project cost
Activity
Normal
(Wks)
Crush
(Wks)
Cost
Slope
(K$)
Tn Cn Tc Cc
A 9 10 6 16 2
B 8 9 5 18 3
C 5 7 4 8 1
D 8 9 6 19 5
E 7 7 3 15 2
F 5 5 5 5 -
G 5 8 2 23 5
Crashing Example
A
D
G
F
C
B
E
9
8
8
7
5
5
5
0
22
149
17
8
2
2
10
0
9 1
7
17
Critical Path A-D-G=22wks
The Resource Problem
 Resources and Priorities
 Project network times are not a schedule until resources have
been assigned.
 The implicit assumption is that resources will be available in the
required amounts when needed.
 Adding new projects requires making realistic judgments of resource
availability and project durations.
 Resource-Constrained Scheduling
 Resource leveling (or smoothing) involves attempting to even
out demands on resources by using slack (delaying noncritical
activities) to manage resource utilization.
 People
 Materials
 Equipment
 Working Capital
Kinds of resource
GERT
 A network analysis technique used in project management.
 It allows probabilistic treatment of both network logic and
activity duration estimated.
 The technique was first described in 1966 by Dr. Alan B.
Pritsker of Purdue University.
 Compared to other techniques, GERT is an only rarely used
scheduling technique.
GERT
Contd..
 Utilizes probabilistic and branching nodes
 It represents the node will be reached if any m of its p
immediate predecessors are completed.
m
n
p
Contd..
 It represents a probabilistic output where any of q
outputs are possible
 Each branch has an assigned probability
 When no probability is given, the probability is assumed
to be one for each branch.
1
2
q
Example
Pert, cpm & gert
Pert, cpm & gert

Contenu connexe

Tendances

Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)
Abhishek Pachisia
 
Pert & cpm project management
Pert & cpm   project managementPert & cpm   project management
Pert & cpm project management
Rahul Dubey
 
Pert,cpm, resource allocation and gert
Pert,cpm, resource allocation and gertPert,cpm, resource allocation and gert
Pert,cpm, resource allocation and gert
Raj J Das
 

Tendances (20)

Critical Path Ppt
Critical Path PptCritical Path Ppt
Critical Path Ppt
 
Network Problem CPM & PERT
Network Problem CPM &  PERTNetwork Problem CPM &  PERT
Network Problem CPM & PERT
 
Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)Program Evaluation and Review Technique (PERT)
Program Evaluation and Review Technique (PERT)
 
Pert & Cpm
Pert & CpmPert & Cpm
Pert & Cpm
 
Project scheduling
Project schedulingProject scheduling
Project scheduling
 
Project managemen PERT VS CPM
Project managemen  PERT VS CPMProject managemen  PERT VS CPM
Project managemen PERT VS CPM
 
time cost trade off
 time cost trade off time cost trade off
time cost trade off
 
Pert and CPM
Pert and CPMPert and CPM
Pert and CPM
 
Pert & cpm project management
Pert & cpm   project managementPert & cpm   project management
Pert & cpm project management
 
Critical path method(cpm)
Critical path method(cpm)Critical path method(cpm)
Critical path method(cpm)
 
Project life cycle
Project life cycleProject life cycle
Project life cycle
 
Cpm n pert
Cpm n pertCpm n pert
Cpm n pert
 
Pert,cpm, resource allocation and gert
Pert,cpm, resource allocation and gertPert,cpm, resource allocation and gert
Pert,cpm, resource allocation and gert
 
Critical path method (cpm)
Critical path method (cpm)Critical path method (cpm)
Critical path method (cpm)
 
crashing of project
crashing of project crashing of project
crashing of project
 
Critical path method
Critical path methodCritical path method
Critical path method
 
Project Scheduling
Project SchedulingProject Scheduling
Project Scheduling
 
Critical Path Method
Critical Path MethodCritical Path Method
Critical Path Method
 
Critical path method
Critical path methodCritical path method
Critical path method
 
Network Techniques
Network TechniquesNetwork Techniques
Network Techniques
 

Similaire à Pert, cpm & gert

Pert cpm-120421125920-phpapp02
Pert cpm-120421125920-phpapp02Pert cpm-120421125920-phpapp02
Pert cpm-120421125920-phpapp02
kongara
 
C10 project management
C10 project managementC10 project management
C10 project management
hakimizaki
 
Chapter 12(cpm pert)
Chapter 12(cpm pert)Chapter 12(cpm pert)
Chapter 12(cpm pert)
Debanjan15
 
Projectmanagement anupama-Amit Payal
Projectmanagement anupama-Amit PayalProjectmanagement anupama-Amit Payal
Projectmanagement anupama-Amit Payal
AMIT PAYAL
 
06_Pert cpmugfhghfhxr justify gfghhhhhhh
06_Pert cpmugfhghfhxr justify gfghhhhhhh06_Pert cpmugfhghfhxr justify gfghhhhhhh
06_Pert cpmugfhghfhxr justify gfghhhhhhh
AmitDeshai
 

Similaire à Pert, cpm & gert (20)

A760535773_16727_28_2018_u6.ppt
A760535773_16727_28_2018_u6.pptA760535773_16727_28_2018_u6.ppt
A760535773_16727_28_2018_u6.ppt
 
vk1
vk1vk1
vk1
 
Project management @ bec doms
Project management @ bec domsProject management @ bec doms
Project management @ bec doms
 
Critical path presentation for timely project completion
Critical path presentation for timely project completionCritical path presentation for timely project completion
Critical path presentation for timely project completion
 
Pert cpm-120421125920-phpapp02
Pert cpm-120421125920-phpapp02Pert cpm-120421125920-phpapp02
Pert cpm-120421125920-phpapp02
 
C10 project management
C10 project managementC10 project management
C10 project management
 
C10 project management
C10 project managementC10 project management
C10 project management
 
Chapter 12(cpm pert)
Chapter 12(cpm pert)Chapter 12(cpm pert)
Chapter 12(cpm pert)
 
1.2 project management by bee 2
1.2 project management by bee 21.2 project management by bee 2
1.2 project management by bee 2
 
Pert
PertPert
Pert
 
Chapter 5-Project Management.pptx
Chapter 5-Project Management.pptxChapter 5-Project Management.pptx
Chapter 5-Project Management.pptx
 
Network analysis cpm module3
Network analysis cpm module3Network analysis cpm module3
Network analysis cpm module3
 
45ef51191315a8630a639ff030b4cb67a3df6f49-1657701254277.ppt
45ef51191315a8630a639ff030b4cb67a3df6f49-1657701254277.ppt45ef51191315a8630a639ff030b4cb67a3df6f49-1657701254277.ppt
45ef51191315a8630a639ff030b4cb67a3df6f49-1657701254277.ppt
 
Projectmanagement anupama-Amit Payal
Projectmanagement anupama-Amit PayalProjectmanagement anupama-Amit Payal
Projectmanagement anupama-Amit Payal
 
PERT CPM Intro
PERT CPM IntroPERT CPM Intro
PERT CPM Intro
 
Pert 182
Pert 182Pert 182
Pert 182
 
06 pert cpm
06 pert cpm06 pert cpm
06 pert cpm
 
06_Pert cpmugfhghfhxr justify gfghhhhhhh
06_Pert cpmugfhghfhxr justify gfghhhhhhh06_Pert cpmugfhghfhxr justify gfghhhhhhh
06_Pert cpmugfhghfhxr justify gfghhhhhhh
 
PERT/CPM
PERT/CPMPERT/CPM
PERT/CPM
 
time mamangement.ppt
time mamangement.ppttime mamangement.ppt
time mamangement.ppt
 

Plus de Pranav Krishna (10)

Statistics
StatisticsStatistics
Statistics
 
Thermal pollution
Thermal pollutionThermal pollution
Thermal pollution
 
Air pollution.pptx
Air pollution.pptxAir pollution.pptx
Air pollution.pptx
 
Crop production
Crop productionCrop production
Crop production
 
Evolution and history of computer
Evolution and history of computerEvolution and history of computer
Evolution and history of computer
 
Economic reforms 1991
Economic reforms 1991 Economic reforms 1991
Economic reforms 1991
 
Measures of central tendancy
Measures of central tendancy Measures of central tendancy
Measures of central tendancy
 
Tabulation
Tabulation Tabulation
Tabulation
 
Soil pollution
Soil pollutionSoil pollution
Soil pollution
 
Index number
Index numberIndex number
Index number
 

Dernier

1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi  6.pdf1029-Danh muc Sach Giao Khoa khoi  6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
QucHHunhnh
 
1029 - Danh muc Sach Giao Khoa 10 . pdf
1029 -  Danh muc Sach Giao Khoa 10 . pdf1029 -  Danh muc Sach Giao Khoa 10 . pdf
1029 - Danh muc Sach Giao Khoa 10 . pdf
QucHHunhnh
 
Gardella_Mateo_IntellectualProperty.pdf.
Gardella_Mateo_IntellectualProperty.pdf.Gardella_Mateo_IntellectualProperty.pdf.
Gardella_Mateo_IntellectualProperty.pdf.
MateoGardella
 
Gardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch LetterGardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch Letter
MateoGardella
 

Dernier (20)

Measures of Dispersion and Variability: Range, QD, AD and SD
Measures of Dispersion and Variability: Range, QD, AD and SDMeasures of Dispersion and Variability: Range, QD, AD and SD
Measures of Dispersion and Variability: Range, QD, AD and SD
 
PROCESS RECORDING FORMAT.docx
PROCESS      RECORDING        FORMAT.docxPROCESS      RECORDING        FORMAT.docx
PROCESS RECORDING FORMAT.docx
 
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptxSOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
SOCIAL AND HISTORICAL CONTEXT - LFTVD.pptx
 
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi  6.pdf1029-Danh muc Sach Giao Khoa khoi  6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
 
1029 - Danh muc Sach Giao Khoa 10 . pdf
1029 -  Danh muc Sach Giao Khoa 10 . pdf1029 -  Danh muc Sach Giao Khoa 10 . pdf
1029 - Danh muc Sach Giao Khoa 10 . pdf
 
Key note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdfKey note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdf
 
Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"
Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"
Mattingly "AI & Prompt Design: Structured Data, Assistants, & RAG"
 
Gardella_Mateo_IntellectualProperty.pdf.
Gardella_Mateo_IntellectualProperty.pdf.Gardella_Mateo_IntellectualProperty.pdf.
Gardella_Mateo_IntellectualProperty.pdf.
 
Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024
 
SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...
SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...
SECOND SEMESTER TOPIC COVERAGE SY 2023-2024 Trends, Networks, and Critical Th...
 
Z Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot GraphZ Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot Graph
 
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
 
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptxINDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
 
Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104Nutritional Needs Presentation - HLTH 104
Nutritional Needs Presentation - HLTH 104
 
psychiatric nursing HISTORY COLLECTION .docx
psychiatric  nursing HISTORY  COLLECTION  .docxpsychiatric  nursing HISTORY  COLLECTION  .docx
psychiatric nursing HISTORY COLLECTION .docx
 
Measures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeMeasures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and Mode
 
microwave assisted reaction. General introduction
microwave assisted reaction. General introductionmicrowave assisted reaction. General introduction
microwave assisted reaction. General introduction
 
Advanced Views - Calendar View in Odoo 17
Advanced Views - Calendar View in Odoo 17Advanced Views - Calendar View in Odoo 17
Advanced Views - Calendar View in Odoo 17
 
Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1
 
Gardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch LetterGardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch Letter
 

Pert, cpm & gert

  • 1. Network Scheduling, Planning & Controlling Techniques
  • 2. Introduction  Schedule converts action plan into operating time table  Basis for monitoring and controlling project  Scheduling more important in projects than in production, because unique nature  Sometimes customer specified/approved requirement.  Based on Work Breakdown Structure (WBS)
  • 3.  Graphical portrayal of activities and event  Shows dependency relationships between tasks/activities in a project  Clearly shows tasks that must precede (precedence) or follow (succeeding) other tasks in a logical manner  Clear representation of plan – a powerful tool for planning and controlling project Network
  • 5. History Of PERT/CPM Developed by the US Navy for the planning and control of the Polaris missile program The emphasis was on completing the program in the shortest possible time. PERT Developed by Du Pont to solve project scheduling problems The emphasis was on the trade-off between the cost of the project and its overall completion time CPM
  • 6. Why PERT/CPM?  Prediction of deliverables  Planning resource requirements  Controlling resource allocation  Internal program review  External program review  Performance evaluation  Uniform wide acceptance
  • 7. Applications Of PERT/CPM Techniques 1 • Construction of a Dam or Canal • Construction of a building or highway 2 • Maintenance or Overhaul of aircrafts • Space Flights 3 • Designing a Prototype of a Machine • Development of Supersonic Planes
  • 8. Steps in PERT/CPM 4. Controlling 3. Allocation Of Resources 2. Scheduling 1. Planning
  • 9. Need of PERT/CPM  Prediction of deliverables  Planning resource requirements  Controlling resource allocation  Internal program review  External program review  Performance evaluation  Uniform wide acceptance
  • 10. PERT
  • 11. PERT Project Evaluation and Review Technique (PERT) • U S Navy (1958) for the POLARIS missile program • Multiple task time estimates (probabilistic nature) • Activity-on-arrow network construction • Non-repetitive jobs (R & D work)
  • 12.  PERT is based on the assumption that an activity’s duration follows a probability distribution instead of being a single value  Three time estimates are required to compute the parameters of an activity’s duration distribution:  pessimistic time (a) - the time the activity would take if things did not go well  most likely time (m ) - the consensus best estimate of the activity’s duration  optimistic time (b) - the time the activity would take if things did go well Mean (expected time):te = a + 4m + b 6 Variance: V = b- a 6 2 PERT
  • 13. Use of PERT  In construction activities  Transportation activities  In oil refineries  Computer system-  For manufacturing electric generator machines  Medical and surgical sector  Library activities
  • 14. Importance of PERT System  Reduction in cost  Saving of time  Determination of activities  Elimination of risk in complex activities –  Flexibility  Evaluation of alternatives-  Useful in effective control-  Useful in decision making  Useful is research work
  • 15. Critical path  Those activities which contribute directly to the overall duration of the project constitute critical activities, the critical activities form a chain running through the network which is called critical path.  Critical event : the slack of an event is the difference between the latest & earliest events time. The events with zero slack time are called as critical events.  Critical activities : The difference between latest start time & earliest start time of an activity will indicate amount of time by which the activity can be delayed without affecting the total project duration. The difference is usually called total float. Activities with 0 total float are called as critical activities
  • 16. CPM
  • 17. Critical Path Method (CPM) • E I Du Pont de Nemours & Co. (1957) for construction of new chemical plant and maintenance shut-down • Deterministic task times • Activity-on-node network construction • Repetitive nature of jobs CPM
  • 18.  Path  A connected sequence of activities leading from the starting event to the ending event  Critical Path  The longest path (time); determines the project duration  Critical Activities  All of the activities that make up the critical path CPM calculation
  • 19. Critical path  Those activities which contribute directly to the overall duration of the project constitute critical activities, the critical activities form a chain running through the network which is called critical path.  Critical event : the slack of an event is the difference between the latest & earliest events time. The events with zero slack time are called as critical events.  Critical activities : The difference between latest start time & earliest start time of an activity will indicate amount of time by which the activity can be delayed without affecting the total project duration. The difference is usually called total float. Activities with 0 total float are called as critical activities
  • 20.  Useful at many stages of project management  Mathematically simple  Give critical path and slack time  Provide project documentation  Useful in monitoring costs Benefits of CPM/PERT
  • 21.  Clearly defined, independent and stable activities  Specified precedence relationships  Over emphasis on critical paths  Deterministic CPM model  Activity time estimates are subjective and depend on judgment  PERT assumes a beta distribution for these time estimates, but the actual distribution may be different  PERT consistently underestimates the expected project completion time due to alternate paths becoming critical Limitations to CPM/PERT
  • 22. Activity Predecessor activity A none B none C A D A E B F C G D & E 1 3 2 5 4 6 A B C D E F G Example
  • 23. Activity Predecessor activity A none B A C A D B E C F D ,E Example
  • 25. Project Crashing  Crashing  reducing project time by expending additional resources  Crash time  an amount of time an activity is reduced  Crash cost  cost of reducing activity time  Goal  reduce project duration at minimum cost
  • 26. Time-Cost Relationship  Crashing costs increase as project duration decreases  Indirect costs increase as project duration increases  Reduce project length as long as crashing costs are less than indirect costs Time-Cost Tradeoff time Direct cost Indirect cost Total project cost
  • 27. Activity Normal (Wks) Crush (Wks) Cost Slope (K$) Tn Cn Tc Cc A 9 10 6 16 2 B 8 9 5 18 3 C 5 7 4 8 1 D 8 9 6 19 5 E 7 7 3 15 2 F 5 5 5 5 - G 5 8 2 23 5 Crashing Example
  • 29. The Resource Problem  Resources and Priorities  Project network times are not a schedule until resources have been assigned.  The implicit assumption is that resources will be available in the required amounts when needed.  Adding new projects requires making realistic judgments of resource availability and project durations.  Resource-Constrained Scheduling  Resource leveling (or smoothing) involves attempting to even out demands on resources by using slack (delaying noncritical activities) to manage resource utilization.
  • 30.
  • 31.  People  Materials  Equipment  Working Capital Kinds of resource
  • 32. GERT
  • 33.  A network analysis technique used in project management.  It allows probabilistic treatment of both network logic and activity duration estimated.  The technique was first described in 1966 by Dr. Alan B. Pritsker of Purdue University.  Compared to other techniques, GERT is an only rarely used scheduling technique. GERT
  • 34. Contd..  Utilizes probabilistic and branching nodes  It represents the node will be reached if any m of its p immediate predecessors are completed. m n p
  • 35. Contd..  It represents a probabilistic output where any of q outputs are possible  Each branch has an assigned probability  When no probability is given, the probability is assumed to be one for each branch. 1 2 q