π Lecture 43 β PROJECT MANAGEMENT
π Overview: This lecture introduces the fundamental concepts of project management, distinguishing it from ongoing operations. It covers the behavioral aspects of projects, key success factors, network diagrams (AOA and AON), work breakdown structure, and an overview of PERT/CPM techniques. The lecture also discusses project life cycle, responsibilities of a project manager, and the critical issue of scope creep.
ποΈ Topics Covered
The lecture covers defining projects and project management, distinguishing characteristics and key success factors, administrative issues, a hospital project example with Gantt charts and network diagrams (AOA and AON), project life cycle, responsibilities and qualifications of a project manager, work breakdown structure, an introduction to PERT and CPM with their advantages and limitations, and the concepts of project scope and scope creep.
π Lecture Summary
Learning Objectives
After completing this lecture (and the next), students should understand the behavioral aspects of projects regarding personnel and the project manager. They should appreciate the nature and importance of work breakdown structure in project management and develop a working knowledge of PERT/CPM techniques. The goal is to construct simple network diagrams, assimilate the information that PERT or CPM analysis provides, analyze networks with probabilistic times, and describe activity βcrashing.β
Projects
Projects are unique, one-time (temporary) operations designed to accomplish a specific set of objectives in a limited time frame. This temporary and one-time nature contrasts with operations, which are permanent or semi-permanent ongoing functional work to create the same product or service repeatedly. The management of these two systems requires varying technical skills and philosophy, necessitating the development of project management.
π‘ Why this matters: Understanding the fundamental difference between a project and ongoing operations is crucial for selecting the right management approach, tools, and personnel for any work effort.
Project Management
Project Management is the organizing and managing resources so that these resources deliver all the work required to complete a project within defined scope, time, and cost constraints.
Distinguishing characteristics of Project Management:
- How is it different?
- Limited time frame
- Narrow focus, specific objectives
- Less bureaucratic
- Why is it used?
- Special needs
- Pressures for new or improved products or services
- Important key metrics:
- Time
- Cost
- Performance objectives
Key Success Factors
Key Success Factors for project management include:
- Top-down commitment
- Having a capable project manager
- Having time to plan
- Careful tracking and control
- Good communications
Major administrative issues in project management include:
- Executive responsibilities
- Project selection
- Project manager selection
- Organizational structure
- Organizational alternatives
- Manage within functional unit
- Assign a coordinator
- Use a matrix organization with a project leader
Project management normally involves the knowledge of project management tools, Work Breakdown Structure, Network diagram, Gantt charts, and Risk management.
Project Management: Hospital
The lecture presents a task of setting up a hospital facility. The project managers are required to list activities in the form of Planning and Scheduling (Gantt Chart) and Network Diagram AON and AOA Activities.
Gantt chart example activities: Locate new facilities, Interview staff, Hire and train staff, Select and order Machinery, Remodel and install machines, Start Attending Patient.
Project Management: Hospital Construction and Operation Activities include:
- Locate new facilities
- Interview staff
- Hire and train staff
- Select and order Machinery
- Remodel and install phones
- Start Patient Examination/startup
Network Diagrams and Conventions
Network diagrams use different conventions. The lecture introduces two main types: Activity on Arrow (AOA) and Activity on Node (AON). Dummy activities are used in AOA to show logical dependencies that do not consume time or resources.
Key terms defined:
- Activity on Arrow: The network diagram convention in which arrows designate activities.
- Activity on Node: The network diagram convention in which the nodes designate the activities.
- Activities: Project steps that consume resources (and/or time).
- Events: The starting and finishing of activities designated by nodes in the Activity on Arrow notation.
- Path: Sequence of activities that leads from the starting node to the finishing node.
- Critical path: The longest path; determines expected project duration.
- Critical activities: Activities on the critical path.
- Slack: Allowable slippage for a path; the difference between the length of the path and the length of the critical path.
π Example: The lecture provides a network with paths and their lengths.
- Path 1-2-3-4-5-6: Length = 18 weeks, Slack = 2
- Path 1-2-5-6: Length = 20 weeks, Slack = 0 (This is the Critical Path)
- Path A (third path): Length = 14 weeks, Slack = 6
Project Life Cycle
The Project Life Cycle comprises a new concept idea for a unique activity, which is then evaluated through feasibility reports, planned with a sequence of activities, executed, and terminated. The stages are:
- Concept
- Feasibility
- Planning
- Execution
- Termination
Planning and Scheduling involves key decisions: deciding which projects to implement, selecting a project manager and team, planning and designing the project, managing and controlling resources, and deciding if/when a project should be terminated.
Responsibilities of a Project Manager
The Project Manager is responsible for project management as well as technical and financial analysis. The lecture notes that a project manager should have qualifications like PMP certification, CFM, CFA, or CFP certification.
The project manager should be skilled in calculating Financial Evaluation and Investment Analysis and Cost Benefit Analysis. They must focus on Ethical Issues and avoid:
- Temptation to understate costs
- Withhold information
- Misleading status reports
- Falsifying records
- Compromising workersβ safety
- Approving substandard work
Work Breakdown Structure
A good project management practice is to breakdown the project into sub-levels or groups of similar activities. This sub-level or group is called a Work Breakdown Structure (WBS). The WBS usually represents a Parent Child Activity relationship between levels, allowing a project manager to incorporate more administrative control over project activities. The lecture shows a WBS with Project at Level 1, and subsequent levels breaking down the work further.
π Definition β Work Breakdown Structure (WBS) : A hierarchical decomposition of the total scope of work to be carried out by the project team to accomplish the project objectives and create the required deliverables.
PERT and CPM
PERT stands for Program Evaluation and Review Technique. CPM stands for Critical Path Method.
These techniques:
- Graphically display project activities
- Estimate how long the project will take
- Indicate most critical activities
- Show where delays will not affect the project
Advantages of PERT:
- Forces managers to organize
- Provides graphic display of activities
- Identifies critical activities
- Identifies slack activities
Limitations of PERT:
- Important activities may be omitted
- Precedence relationships may not be correct
- Estimates may include a fudge factor
- May focus solely on critical path
Project Scope and Scope Creep
Project Scope refers to the total work needed out of a project. The primary tool to describe project scope is the Work Breakdown Structure.
Scope creep is the unnecessary extension of project scope which does not allow the project to be completed within budget and time limits. Two types of scope creep are identified:
- Technical Scope creep (Gold plating): The tendency of the technical side to add avoidable and costly features to make the product/service more powerful and attractive.
- Business Scope creep (Customer pleasing): The tendency of business managers to overdo customer relationships.
A pragmatic strategy to avoid scope creep is to be judicious to the original project scope and religiously avoid uncalled-for additions.
π‘ Why this matters: Scope creep is one of the most common causes of project failure. Understanding and actively managing it is a core responsibility of the project manager.
β Key Takeaways
The most critical takeaway is that projects are unique, temporary endeavors fundamentally different from repetitive operations, requiring dedicated management focused on time, cost, and performance. Mastery of network diagrams (AOA and AON) is essential for scheduling and identifying the critical path, which dictates the project's minimum duration. The Work Breakdown Structure (WBS) is the foundational tool for defining all project work and avoiding scope creep. Students must also understand the ethical responsibilities of a project manager and the administrative issues that contribute to project success.
π§ Quick Revision Questions
- What is the primary difference between a "project" and "operations"?
- List the three key metrics (constraints) of project management.
- What is the "critical path" in a network diagram?
- What is the main purpose of a Work Breakdown Structure (WBS)?
- Define "scope creep" and explain the difference between its technical and business forms.
π Lecture 44 β Project Management (Contd.)
π Overview: This lecture continues the study of project management, focusing on quantitative methods for estimating activity times, calculating the critical path, and managing project duration. It introduces probabilistic time estimates and variance to handle uncertainty, the concept of crashing to reduce project length, and practical tools for risk management and project control.
ποΈ Topics Covered
This lecture covers time estimates, both deterministic and probabilistic, including the computation of expected time and variance using the PERT formula. It details the forward and backward pass algorithms for calculating Early Start, Early Finish, Late Start, and Late Finish, and how to determine slack and the critical path. The lecture then explains the time-cost trade-off involved in project crashing, discusses project management software, and concludes with risk management and operations strategy for projects.
π Lecture Summary
Time Estimates
There are two common types of time estimates. Deterministic time estimates are used when activity durations are fairly certain. Probabilistic time estimates are used when there is variation, allowing for a range of possible durations.
π Definition β Deterministic Estimate: Time estimates that are fairly certain. π Definition β Probabilistic Estimate: Estimates of times that allow for variation.
Computing Algorithm
Network activities are defined by their Early Start (ES), Early Finish (EF), Late Start (LS), and Late Finish (LF). These values are used to determine the expected project duration, slack time, and the critical path.
π Definition β Early Start (ES): The earliest time an activity can begin. π Definition β Early Finish (EF): The earliest time an activity can be completed (EF = ES + Activity Time). π Definition β Late Start (LS): The latest time an activity can begin without delaying the project. π Definition β Late Finish (LF): The latest time an activity can be completed without delaying the project. π Definition β Slack Time: The amount of time an activity can be delayed without affecting the project completion date (Slack = LS - ES or LF - EF).
Probabilistic Time Estimates
Probabilistic estimates require three time estimates for each activity: Optimistic time (to), Pessimistic time (tp), and Most likely time (tm). These are used to calculate the Expected Time (te) and Variance (ΟΒ²).
π Definition β Optimistic time (to): Time required under optimal conditions. π Definition β Pessimistic time (tp): Time required under worst conditions. π Definition β Most likely time (tm): The most probable length of time that will be required.
π Formula: Expected Time (te) = (to + 4tm + tp) / 6 β This is a weighted average giving more weight to the most likely time.
π Formula: Variance (ΟΒ²) = ((tp β to) / 6)Β² β The variance reflects the degree of uncertainty; a larger variance indicates greater uncertainty.
π Example: To calculate the expected time for Activity U (to=35, tm=50, tp=65): te = (35 + 4(50) + 65) / 6 = (35 + 200 + 65) / 6 = 300 / 6 = 50 days. The standard deviation for Activity U is Ο = (65 β 35) / 6 = 30 / 6 = 5 days.
Path Probabilities
The probability of completing a path by a specified time can be calculated using the z statistic.
π Formula: Z = (Specified time β Path mean) / Path standard deviation β Z indicates how many standard deviations the specified time is from the expected path duration.
π Definition β Z: A value used to find the probability from the standard normal distribution table. If Z is +2.50 or more, the probability of completion by the specified time is treated as 100 percent.
π Example: From the "Reforestation Project" example, the critical path (V-X-Y-Z) has an expected duration (ΞΌ) of 170 days and a standard deviation (Ο) of 10 days. The probability of completing the project within 200 days is found by calculating Z = (200 β 170) / 10 = 3.0. From the standard normal table, the area for Z=3.0 is 0.4987. Adding 0.5 gives a probability of 0.9987 (99.87%). The portfolio project Ο of 10 days is less than the sum of individual standard deviations (18 days), confirming the portfolio variance calculation is correct.
Time-cost Trade-offs: Crashing
Crashing is the process of shortening the duration of a project. The procedure for crashing involves crashing only an activity on the critical path, one period at a time, and always crashing the least expensive activity. If multiple critical paths exist, the sum of crashing the least expensive activity on each critical path must be found.
π‘ Why this matters: Crashing a project involves paying more money to complete it more quickly. The goal is to reduce the project length until it meets the desired target or the cost of crashing exceeds the savings from a shorter project.
π Definition β Crashing: Shortening activity duration by paying more for resources.
Project Management Software Tools
Several software tools exist to assist with project management. These include Computer Aided Design (CAD), Groupware (Lotus Notes), and specialized Project Management Software like CA Super Project, Harvard Total Manager, MS Project, Sure Track Project Manager, and Time Line.
The advantages of PM software include: it imposes a methodology, provides a logical planning structure, enhances team communication, flags constraint violations, provides automatic report formats, allows multiple levels of reports, enables what-if scenarios, and generates various chart types.
Project Risk Management
Risk is the occurrence of events that have undesirable consequences, such as delays, increased costs, inability to meet specifications, or project termination.
π Definition β Risk: The occurrence of events that have undesirable consequences.
Risk management involves four steps: 1) Identify potential risks, 2) Analyze and assess risks, 3) Work to minimize the occurrence of risk, and 4) Establish contingency plans.
Operations Strategy
Organizations may set up a separate Project Management department to administer unique and non-repetitive activities. The scope of the project decides whether to use project management software. Project teams often operate as a matrix team, where employees from different functional departments work with the project team. The strategy is that the project manager should lead the team as they are more aware of the overall organizational situation.
β Key Takeaways
The most critical concepts from this lecture are the distinction between deterministic and probabilistic time estimates and the PERT formula (te = (to + 4tm + tp)/6) for calculating expected activity times. You must master the forward and backward pass algorithms to compute ES, EF, LS, LF, and slack, which are essential for identifying the critical path, the longest path determining project duration. For handling uncertainty, you must understand how to compute variance and use the Z-statistic to calculate the probability of completing a project by a specified date. Finally, remember that "crashing" is a time-cost trade-off technique used to shorten a project by focusing on critical path activities, always selecting the least expensive option.
π§ Quick Revision Questions
- What is the formula for calculating the expected time (te) in a probabilistic time estimate, and what do the variables (to, tm, tp) stand for?
- How is slack time calculated for an activity, and what does a slack value of zero indicate?
- Explain the procedure for "crashing" a project. What is the primary rule for selecting which activity to crash?
- Which path determines the overall project duration, and how is its total expected time calculated from the network diagram?
- In the "Reforestation Project" example, what was the calculated standard deviation for the entire critical path, and what did this value allow you to calculate?
π Lecture 45 β Waiting Lines
π Overview: This lecture introduces the concept of waiting lines (queues) in production and operations management. It explains why waiting lines form even in unloaded systems, identifies the goal of queuing analysis (minimizing the sum of customer waiting costs and service capacity costs), and covers key measures of system performance. The lecture also explores simulation as a tool for analyzing complex queuing systems and discusses broader operations strategies for managing waiting lines.
ποΈ Topics Covered
The lecture begins by explaining the formation of waiting lines in unloaded systems, their non-value-added nature, and examples from everyday life. It then defines queuing theory and its goals, introduces the cost trade-off between service capacity and customer waiting, and discusses negative exponential and Poisson distributions. System characteristics (infinite vs. finite sources, number of servers, queue discipline) and waiting line models (patient, reneging, jockeying, balking) are covered. The lecture presents finite-source formulas, other non-mathematical approaches including simulation (Monte Carlo, computer simulation), and concludes with operations strategy and broader applications beyond the final exam.
π Lecture Summary
Visit to a Cricket Stadium
Waiting in lines does not add enjoyment nor generate revenue; waiting lines are non-value added occurrences. They are formed at airports, cricket stadiums, and post offices due to non-scheduled random arrivals and are often regarded as poor service quality.
Waiting Line Examples
Examples include orders waiting to be filled, trucks waiting to be loaded or unloaded, jobs waiting to be processed, equipment waiting to be loaded, and machines waiting to be repaired.
Service Station as a Waiting Line Example
A service station is usually designed to provide service on average service time. At the macro level, the system is unloaded; at the micro level, the system is overloaded β a Paradox. Customers arrive at random rates, and service requirements vary (only oil change or even tuning/maintenance).
Waiting Lines
Queuing theory: Mathematical approach to the analysis of waiting lines.
- Goal of queuing analysis is to minimize the sum of two costs: Customer waiting costs and Service capacity costs.
- Waiting lines are non-value added occurrences.
Implications of Waiting Lines
- Cost to provide waiting space
- Loss of business (customers leaving, customers refusing to wait)
- Loss of goodwill
- Reduction in customer satisfaction
- Congestion may disrupt other business operations
Queuing Analysis
Organizations carry out queuing analysis to ensure they balance service levels with costs. The ultimate goal of queuing analysis is to minimize the sum of service capacity cost (represented on the x-axis) and customer waiting costs.
- Total cost = Customer waiting cost + Capacity cost
- There is an Optimum point where the total cost is minimized, balancing the cost of service capacity and the cost of customers waiting.
π Definition β Negative Exponential Distribution: A common queuing system where the probability that the service time (t) is greater than or equal to a certain time (T) is given by a random number (RN). The formula is ( P(t \ge T) = RN ).
Queue discipline is considered a primary requirement in service systems. However, hospital emergency rooms, rush orders in factories, and mainframe computer processing of jobs do not follow queue discipline.
System Characteristics
- Population Source: a. Infinite source: Customer arrivals are unrestricted. b. Finite source: Number of potential customers is limited.
- Number of observers (channels)
- Arrival and service patterns
- Queue discipline (order of service)
Elements of a Queuing System
Population Source, Arrivals, Waiting Line, Processing Order, Service System, and Exit are the common identifiable elements of a Queuing System.
Queuing Systems
The system characteristics are:
- Population Source
- Number of Servers (Channels)
- Arrival and Service Patterns
- Queue Discipline
π Definition β Channel: A server in a service system.
Multiple Channels and Multiple Phases are configurations of service systems.
Poisson Distribution
Poisson distribution is a discrete probability distribution that expresses the probability of a number of events occurring in a fixed period of time if these events occur with a known average rate and are independent of the time since the last event.
Waiting Line Models
As a student of Operations Management, you can identify the following types of waiting line models:
- Patient: Customers enter the waiting line and remain until served.
- Reneging: Waiting customers grow impatient and leave the line.
- Jockeying: Customers may switch to another line.
- Balking: Upon arriving, customers decide the line is too long and decide not to enter the line.
Waiting Time vs. Utilization
The figure represents an increase in system utilization at the expense of an increase in both the length of the waiting line and average waiting time. These values increase as utilization approaches 100 percent. The implication is that under normal circumstances, 100 percent utilization is not a realistic goal.
System Performance
- Average number of customers waiting
- Average time customers wait
- System utilization
- Implied cost
- Probability that an arrival will have to wait
Example Service Station (Queuing Models: Infinite-Source)
- Single channel, exponential service time
- Single channel, constant service time
- Multiple channel, exponential service time
- Multiple priority service, exponential service time
Priority Model
Arrivals are assigned a priority as they arrive. Processing order is determined by priority level (e.g., 1, 3, 2, 1, 1), not by arrival time.
Finite-Source Formulas
-
Service Factor: ( X = \frac{T}{T + U} )
- Where T = average service time, U = average time between service requests
-
Average Number Waiting: ( L = N(1 - F) )
- Where N = number in population, F = efficiency factor
-
Average Waiting Time: ( W = \frac{L(T + U)}{N - L} = \frac{T(1 - F)}{XF} )
-
Average Number Running: ( J = NF(1 - X) )
-
Average Number Being Served: ( H = FNX )
-
Number in Population: ( N = J + L + H )
Finite-Source Queuing
The population consists of:
- J = Not waiting or being served
- L = Waiting
- H = Being served
Where U = average time between service requests, W = average waiting time, T = average service time.
The efficiency factor ( F = \frac{J + H}{J + L + H} )
Other Approaches (Non-Mathematical Approaches)
- Reduce perceived waiting time
- Magazines in waiting rooms
- Radio/television
- In-flight movies
- Filling out forms
- Derive benefits from waiting
- Place impulse items near checkout
- Advertise other goods/services
Simulation
Simulation: A descriptive technique that enables a decision maker to evaluate the behavior of a model under various conditions.
- Simulation models complex situations
- Models are simple to use and understand
- Models can play "what if" experiments
- Extensive software packages available
Simulation Process
- Identify the problem
- Develop the simulation model
- Test the model
- Develop the experiments
- Run the simulation and evaluate results
- Repeat steps 4 and 5 until results are satisfactory
Monte Carlo Simulation
Monte Carlo method: Probabilistic simulation technique used when a process has a random component.
- Identify a probability distribution
- Set up intervals of random numbers to match probability distribution
- Obtain the random numbers
- Interpret the results
Example Showing the use of Microsoft Excel
An Operations Manager makes best use of the power of Microsoft Excel by carrying out simulation. The first picture shows a snapshot with the formulae, and the second picture represents the actual values.
Simulating distributions commonly used are the Poisson and Normal distributions.
-
Poisson distribution: Mean of distribution is required
-
Normal distribution: Need to know the mean and standard deviation
-
Simulated Value (for Normal) = Mean + Random Number Γ Standard Deviation
Uniform Distribution
Simulated Value (for Uniform) = ( a + (b - a)(\text{Random number as a percentage}) ) Where a = lower bound, b = upper bound.
Computer Simulation
Simulation languages include:
- SIMSCRIPT II.5
- GPSS/H
- GPSS/PC
- RESQ
Advantages of Simulation:
- Solves problems that are difficult or impossible to solve mathematically
- Allows experimentation without risk to actual system
- Compresses time to show long-term effects
- Serves as training tool for decision makers
Limitations of Simulation:
- Does not produce optimum solution
- Model development may be difficult
- Computer run time may be substantial
- Monte Carlo simulation only applicable to random systems
Why Simulation is necessary:
- Mathematics involved is too complicated
- Easier to manipulate than reality
- Software and hardware permit modeling
Simulation Steps:
- Problem formulation
- Model building
- Data acquisition
- Model translation
- Verification & validation
- Experiment planning & execution
- Analysis
- Implementation & documentation
Operations Strategy
- The central idea for formulating an Operations Strategy for Waiting Line concepts is designing a service system to achieve a balance between service capacity and customer waiting time.
- The operations strategy should be able to identify an appropriate and acceptable level of service capacity as well as quality so waiting lines are not formed or are manageable and acceptable to customers.
- Often organizations, when challenged by lack of practical solutions or space constraints, opt for more tangible quality-based solutions by engaging waiting customers in activities that give them an opportunity to make use of the time and make waiting less painful and more pleasant.
β Key Takeaways
The key takeaway is that waiting lines are non-value added occurrences that form even in unloaded systems due to random arrivals and variable service times, making 100% utilization an unrealistic goal. The ultimate goal of queuing analysis is to minimize the total cost, which is the sum of customer waiting costs and service capacity costs. Waiting line models can be classified by population source (infinite vs. finite), number of servers, arrival and service patterns, and queue disciplineβwith Poisson distribution for arrivals and negative exponential distribution for service times being common assumptions. Simulation (especially Monte Carlo) is a powerful tool for analyzing complex queuing situations that are difficult to solve mathematically. Finally, the operations strategy should focus on balancing service capacity with customer waiting time, and when possible, engage waiting customers in activities to reduce perceived waiting time.
π§ Quick Revision Questions
- What is the ultimate goal of queuing analysis, and what two costs does it seek to balance?
- What are the four main characteristics used to classify queuing systems, and what is the difference between an infinite source and a finite source?
- What are the four types of waiting line customer behaviors (patient, reneging, jockeying, balking)?
- How does system utilization affect waiting time and line length, and why is 100% utilization not a realistic goal?
- What is the Monte Carlo simulation method, and what are its key advantages and limitations?