Project Management Flashcards
Projects
Unique, one-time operations designed to accomplish
a specific set of objectives in a limited time frame
Examples: (Olympic games, producing a movie, software development, product development, ERP implementation)
Project Life Cycle
Definition
Planning
Execution
Delivery
Project Manager
Project manager is ultimately responsible for the success or failure of the project
Must manage: The work the human resources communication quality/time/costs
Behavioral Issues
Behavioral problems can be created or exacerbated by decentralized decision making, stress of achieving project milestones on time & within budget, suprises
The team must be able to function as a unit
(interpersonal & coping skills are very important
Avoiding Problems
Many problems can be avoided or mitigated by: -effective team selection – Leadership – Motivation – Maintain an environment of• Integrity • Trust • Professionalism – being supportive of team efforts
Work Breakdown Structure (WBS)
- a hierarchical listing of what must be done during a project
-establishes a logical framework for identifying that required actives for the project
(identify the major elements of the project, identify the major supporting activities for each of the major elements, break down each major supporting activity into a list of the activities that will be needed to accomplish it.
PERT & CPM
PERT (program evaluation & review technique) & CPM (critical path method) are two techniques used to manage large scale projects
Network Diagram
Network diagram
Diagram of project activities that shows sequential relationships by use of
arrows and nodes
Activity on arrow (AOA)
Network diagram convention in which arrows designate activities
Activity on node (AON)
Network convention in which nodes designate activities
– Activities
» Project steps that consume resources and/or time
– Events
» The starting and finishing of activities
Deterministic Time Estimates
Deterministic
– Time estimates that are fairly certain
• Probabilistic
– Time estimates that allow for variation
Slack & Critical Path
slack can be computed one of two ways: - slack= LS-ES - slack= LF-EF Critical Path -the critical path is indicated by the activities with zero slack
Using Slack times
Knowledge of slack times provides managers with information for planning allocation of scarce resources
Control efforts will be directed toward those activities that might be most susceptible to delaying the project
Activity slack times are based on the assumption that all of the activities on the same path will be started as early as possible and not exceed their expected time
If two activities are on the same path and have the same slack, this will be the total slack available to both
Time-Cost Trade-Offs
Activity time estimates are made for some given level of resources
• It may be possible to reduce the duration of a project by injecting additional resources
– Motivations:
• To avoid late penalties
• Monetary incentives
• Free resources for use on other projects
Crashing
Crashing
– Shortening activity durations
• Typically, involves the use of additional funds to support additional personnel or more efficient equipment, and the relaxing of some work specifications
– Theprojectdurationmaybeshortenedbyincreasingdirect expenses, thereby realizing savings in
indirect project costs
Crashing Decisions
To make decisions concerning crashing requires information about:
1. 2. 3.
Regular time and crash time estimates for each activity
Regular cost and crash cost estimates for each activity
A list of activities that are on the critical path Critical path activities are potential candidates for crashing
Crashing non-critical path activities would not have an impact on overall project duration
Crashing: Procedure
General procedure:
1. 2. 3.
•
Crash the project one period at a time
Crash the least expensive activity that is on the critical path
When there are multiple critical paths, find the sum of crashing the least expensive activity on each critical path
If two or more critical paths share common activities, compare the least expensive cost of crashing a common activity shared by critical paths with the sum for the separate critical paths