Final Merged (1)
Final Merged (1)
Operations
Analysis
SESSION 7
HTM*3120
Quick Review
Facility Location
Workshop – Part I
Weekly
Topics Huff Model of Retail Location
Workshop – Part II
Do
◦ Implement the solution, even if on a trial basis.
7-6
PDCA Cycle
Check
◦ Review and evaluate the results of the change. Check
that the solution is having the intended effect and
note any unforeseen consequences.
Act
◦ Reflect and act on learning from the experience. If
successful, the process changes are standardized and
communicated to all involved workers with training.
7-7
Steps to the PDCA Cycle
Plan
◦ Define the problem and its impact – Start with identifying
what’s wrong; what’s the current state? What’s the problem
and what should it all look like in an ideal world?
◦ Understand the facts – This is the inductive problem solving
part. Watch, observe and measure the problem with data,
first.
◦ Contain the problem – As there’s a problem happening right
now, this next step is to ensure the problem doesn’t get any
bigger. If it’s a process problem, the main aim is to ensure it
never reaches the customer.
Steps to the PDCA Cycle
Plan (cont’)
◦ Measure the data – It’s now time to delve deeper into the
inductive problem-solving phase.
◦ Find the root cause to the problem – You’re now in a position
of knowledge. You’ve observed and analyzed what’s
happening. You’ve also created a list of the many potential
root causes.
Do
◦ Implement the corrective action – Here’s where you apply the
heavy lifting. You’ve looked at the problem; analyzed the data,
contained the problem and identified a root cause.
Steps to the PDCA Cycle
Check
◦ Check the data after the correction, to ensure its worked
– This is pretty self-explanatory. It’s now time to observe some
more, and to see if the solution has worked or not.
Act
◦ Standardize the process to support what you’ve learned
– Now, you must extrapolate the lessons learned and lock in
the change. In most instances, this would entail a process
change of some sort.
◦ Recognize and provide positive feedback – Celebrate a job
well done; congratulate the team and let everyone know of
the achievement.
Steps to the PDCA Cycle
Quality Tools for Analysis and
Problem Solving
◦ Check Sheet
◦ Run Chart
◦ Histogram
◦ Pareto Chart
◦ Flowchart
◦ Cause-and-Effect Diagram
◦ Scatter Diagram
◦ Control Chart
◦ Benchmarking
7-12
Check Sheet
A historical record of observations, and it
represents the source of data to begin the analysis
and problem identification.
Check Sheet of Problems faced by
an Airline
Lost Departure
Month Mechanical Overbooked Other
Luggage Delay
January 1 2 3 3 1
February 3 3 0 1 0
March 2 5 3 2 3
April 5 4 4 0 2
May 4 7 2 3 0
June 3 8 1 1 1
July 6 6 3 0 2
August 7 9 0 3 0
September 4 7 3 0 2
October 3 11 2 3 0
November 2 10 1 0 0
December 4 12 2 0 1
Total 44 84 24 16 12
7-14
Run Chart
A chart that tracks the changes in a process over
time to detect trends, shifts, or cycles in
performance.
◦ They are easy to interpret and are useful in
predicting trends.
◦ They can be used to track changes before and after
changes to processes.
Run Chart
Run Chart of
Departure
Delays
Histogram
A histogram presents data collected over a period
of time as a frequency distribution in bar chart
form.
Histogram of
Lost Luggage
Pareto Chart
A pareto chart orders problems by their relative
frequency in a descending bar graph to focus
efforts on the problem that offers the greatest
potential improvement.
Pareto Chart
Flowchart
Flow charts are visual representations of the
process that can be used to identify points where
problems might occur.
Diamonds represent decision points.
Scatter Diagram of
Departure Delay vs
Late Passengers
Control Chart
Control charts are used to monitor process. Control charts help you to
see when a process is out of control.
Control Chart of
Departure
Delays
Quality
Improvement
Programs
Quality Improvement
Programs
◦ Benchmarking
◦ Deming’s 14 Point Program
◦ ISO 9000
◦ Six-Sigma
◦ Lean Service
Benchmarking
Comparison of how your company is doing through
comparison to other companies that are classified as
‘best-in-class’.
Benchmarking involves five steps:
1. Select a critical process that needs improvement;
2. Identify an organization that excels in the process;
3. Contact the benchmarked firm, make a visit and study the
process;
4. Analyze the findings;
5. Improve your process accordingly.
Deming’s 14 Point Program
1. Create constancy of purpose for improvements of product and
service.
◦ Move beyond preoccupation with next quarter and build for the future.
2. Adopt the new philosophy.
◦ Refuse to allow commonly accepted poor levels of work, delays, and lax
service.
3. Cease dependence on mass inspection.
◦ Focus on improving the process itself, instead of focusing on inspection.
4. End the practice of awarding business on price tag alone.
◦ Purchase should be made on the basis of statistical evidence of quality,
not price.
Deming’s 14 Point Program
5. Constantly and forever improve the system of production and
service.
◦ Search continually for problems in the system, and seek ways for
improvement.
6. Institute modern methods of training on the job.
◦ Restructure training to define acceptable levels of work.
7. Institute modern methods of supervising.
◦ Focus supervision on helping workers to do a better job. Provide the
tools and techniques to promote pride in one’s work.
8. Drive out fear.
◦ Eliminate fear by encouraging the communication of problems and
expression of ideas.
Deming’s 14 Point Program
9. Break down barriers between departments.
◦ Encourage problem solving through teamwork and use of quality-control
circles.
10. Eliminate numerical goals for the workforce.
◦ Goals, slogans, and posters cajoling workers to increase productivity
should be eliminated. Such exhortations cause worker resentment,
because most of the necessary changes are outside their control.
11. Eliminate work standards and numerical quotas.
◦ Production quotas focus on quantity, and they guarantee poor quality in
their attainment. Use statistical methods for continuing improvement of
quality and productivity.
Deming’s 14 Point Program
12. Remove barriers that hinder hourly workers.
◦ Workers need feedback on the quality of their work. All barriers to pride
in one’s work must be removed.
13. Institute a vigorous program of education and training.
◦ Because of changes in technology and turnover of personnel, all
employees need continual training and retraining. All training must
include basic statistical techniques.
14. Create a structure in top management that will push every day on
the above 13 points.
◦ Clearly define management’s permanent commitment to continuous
improvements in both quality and productivity.
Eureka
Ranch!
USING DEMING'S
MODEL OF
STATISTICAL
APPROACH | EXAMPLE
“say what you do, and do
ISO 9000
what you say”
A Plane is any
Destination j
representation in
two-dimensional
space: a surface
Origin i
0 X
Euclidean Distance
Location on a Plane
Y
Destination j
Yj Euclidean distance
(as the Crow flies)
The shortest
Yi
distance between
Origin i
two points is a
straight line.
0 X
Xi Xj
Euclidian Distance
Utilizing the Pythagorean theorem to measure Euclidian distance, we
get:
Where
dij = distance between points i and j
xi, yi = coordinates of the ith point
xj, yj – coordinates of the jth point
Euclidean Distance.. As the crow flies
Example of Euclidean
Distance Calculation
Calculate the shortest distance between two points with
the following coordinates:
X Y
Origin 7 9
Destination 1 1
Location on a Plane
Y
Destination j
Yj
Yi Origin i
Metropolitan Distance
0 X
Xi Xj
Example of Metropolitan distance..
END
START
To travel from one point to another, you must proceed on a grid-like route.
Example of Metropolitan distance..
END
START
X Y
Origin 5 1
Destination 2 8
Metropolitan Distance = |5 – 2| + |1 - 8| = 10
Comparing Euclidean and
Metropolitan Distances
X Y
Origin 3 8
Destination 5 3
Primarily Used by
aircraft, ships, radar
A vector is a distance
from an origin,
whose direction is
defined by an angle.
Huff Model of
Retail Location
Huff Model of Retail Location
A quantitative model that predicts retail performance from
geo-demographic data
(j=2, Existing) 1 5 7 7 1
◦ Few Suppliers
◦ The forming of long-term relationships with a few suppliers.
Supply-Chain Strategy
◦ Vertical Integration
◦ Backward integration
◦ A firm purchases its
suppliers
◦ Forward integration
◦ A firm purchases its
buyers
https://www.investopedia.com/ask/answers/051315/what-difference-between-horizontal-integration-and-
vertical-integration.asp
Supply-Chain Strategy
◦ Joint Ventures
◦ Working with others in your industry through formal
collaboration.
◦ Can help to reduce costs or secure supply.
◦ Keiretsu
◦ Part purchasing from few suppliers and part vertical integration.
◦ Manufacturers are often financial supporters through
ownership or loans.
◦ Creates long-term relationships.
Supply-Chain Strategy
◦ Virtual companies
◦ Use of flexible suppliers.
◦ Fluid, moving, organizational boundaries that allow them to
create a unique enterprise to meet changing market demands.
◦ Advantages include
◦ Specialized management expertise
◦ Low capital investment
◦ Flexibility
◦ Speed
◦ Overall, a more efficient system.
Managing the Supply Chain
◦ Factors for success:
◦ Mutual agreement on goals
◦ Trust
◦ Compatible organizational cultures
Managing
Inventories
Distribution System
Role of Inventory in Services
Decoupling inventories
Seasonal inventories
Speculative inventories
Cyclical inventories
In-transit inventories
Safety stocks
15-98
Role of Inventory in Services
Decoupling inventories
◦ Each stage in the distribution channel has their own stores of information,
and their own replenishment levels.
◦ The time between when an order is placed and when it is received is
referred to as the replenishment lead time
Seasonal inventories
◦ High stocking of inventories may take place at specific times of the year, in
advance of a high predicted demand.
15-99
Role of Inventory in Services
Speculative inventories
◦ When a service anticipates a significant increase in the price of a specific
good, they may stock up on that good at the lower price. The strategy of
managing speculative inventories is known as forward buying.
Cyclical inventories
◦ Refers to the normal variations in inventory levels (stock after inventory
received – stock just before inventory received)
15-100
Role of Inventory in Services
In-transit inventories
◦ Stock that has been ordered but is yet to be received.
Safety stocks
◦ Maintenance of inventory stock that is above expected demand.
15-101
Considerations in Inventory
Systems
◦ Independent versus dependent demand
15-102
Considerations in Inventory
Systems
Independent versus dependent demand
◦ Independent – demands of different items not related to
each other (e.g. bread)
◦ Dependent – demand of one item is related to demand for
another (e.g. ketchup)
15-103
Considerations in Inventory
Systems
Replenishment lead time
◦ The time between when an order is placed and when an
order will be received.
15-104
Relevant Inventory Costs
Ordering costs
Receiving and inspection costs
Holding or carrying costs
Shortage or stock-out costs
Depreciation of value
15-105
Relevant Inventory Costs
Ordering costs
◦ Preparing specifications for items to be purchased
◦ Locating and identifying potential suppliers and soliciting bids
◦ Evaluating bids and selecting suppliers
◦ Negotiating prices
◦ Preparing purchase orders
◦ Issuing or transmitting purchase orders to outside suppliers
◦ Following up to ensure that purchase orders are received by suppliers
15-106
Relevant Inventory Costs
Receiving and inspection costs
◦ Transporting, shipping and pickup
◦ Preparing and handling records of receipts and other paperwork
◦ Examining packages for visible damage
◦ Unpacking items
◦ Counting or weighing items to ensure that the correct amount has been
delivered
◦ Inspecting or testing items to ensure that they conform to purchase
specification
◦ Transferring items into storage area
15-107
Relevant Inventory Costs
Holding or carrying costs
◦ Interest charges on money invested in inventories
◦ Opportunity cost of capital tied up in inventory
◦ Theft or pilferage
◦ Security systems
◦ Breakage, damage, and spoilage
◦ Depreciation
◦ Storage space and facilities
◦ Controlling environments
◦ Managing (e.g. supervising, taking inventory, verifying records, etc.)
15-108
Relevant Inventory Costs
Shortage or stock-out costs
◦ Lost sales and profits
◦ Customer dissatisfaction and ill-will; lost customers
◦ Penalties for late delivery or non-delivery
◦ Expediting orders to replenish exhausted stock
Depreciation of value
15-109
Inventory Management
Questions
What should be the order quantity (Q)?
When should an order be placed, called a reorder point (ROP)?
How much safety stock (SS) should be maintained?
15-110
Outsourcin
g
Outsourcing Process
Need Identification
- Problem definition
-Do-vs-Buy analysis
Performance
- Involve interested parties
Evaluation
-Specification Development
- Identify Evaluator
- Quality of Work Information Search
- Communication - References
Vendor Selection
- Meet Deadlines - Personal Contact
- Experience
- Flexibility -Recommendations
- Reputation
- Dependability
- References
- Cost
- Location
- Size
Benefits of Outsourcing
◦ Allows the firms to focus on core competencies
◦ Decreases costs by purchasing from an outside source
rather than performing in-house.
◦ Provides access to latest technology without
investment.
◦ Leverages benefits from a supplier who has economies
of scale.
Risks of Outsourcing
◦ Loss of direct control over quality
◦ Jeopardizes employee loyalty because of job-loss fears
◦ Exposure to data security and customer privacy issues
◦ Dependence on one supplier compromises future
negotiation leverage
◦ Additional coordination expense and delays
◦ Atrophy of in-house capability to perform outsourced
service
Question
s
Next Week
Session 8
◦ Managing Capacity and Demand
◦ Scheduling
◦ Overbooking
Service Operations
Analysis
HTM*3120
WEEK 8 WORKSHOP
- WORKSHOP QUESTIONS
Managing Capacity and
Demand
Managing Capacity and Demand
Variable and Unpredictable demand is characteristic of
most services
Segmenting Increasing
demand customer
Developing participation
Sharing
complementary
capacity
services
Offering
Scheduling
price
Reservation Cross- work shifts
incentives
systems and training
Overbooking employees
Promoting Creating
off-peak adjustable
Using
Customer- demand capacity
part-time
induced employees
variability
Yield
management
11-5
Level Capacity (Shift
demand)
Customer-Induced Variability
Arrival: customer arrivals are independent decisions not evenly spaced.
Capability: level of knowledge and skills vary resulting in some hand-holding.
Request: uneven service times result from unique demands.
Effort: level of commitment to coproduction or self-service varies.
Subjective Preference: personal preferences introduce unpredictability.
11-7
Strategies for Managing
Customer-induced Variability
Type of Accommodation Reduction
Variability
Arrival Provide generous staffing Require reservations
11-8
Level Capacity
Consideration for leveling Capacity:
Segmenting demand
◦ business vs. leisure travelers
◦ price-sensitive vs. time sensitive
◦ walk-ins vs. appointments
Level Capacity
What actions can be taken to level capacity
beyond segmenting?
Topline profile
Tour
12 2 4 6 8 10 12 2 4 6 8 10 12 12 2 4 6 8 10 12 2 4 6 8 10 12
11-11
Scheduling
Chase (react to) Demand
Daily work shift scheduling
◦ Forecasting demand
◦ Calculate corresponding labour hours
◦ Increase / decrease schedule with full or part time employees
Actions
◦ Use of computer-optimized scheduling (Linear programming)
◦ Labour Scheduling Histogram Heuristic
Labour Scheduling
Histogram Heuristic
Example:
MacDonald’s restaurant has the following requirements for front-line servers
based on a demand forecast for the afternoon shift (4:00 PM – Midnight).
Employees may only work 3 shifts per week:
Monday 2 Friday 5
Tuesday 2 Saturday 4
Wednesday 3 Sunday 2
Thursday 5
1. Find the number of Employees
DAY Servers Time Servers
Monday 2 Friday 5
Tuesday 2 Saturday 4
Wednesday 3 Sunday 2
Thursday 5
Adam X X X 3
Barb X X X 3
Cathy X X X 3
Dave X X X 3
Elisabeth X X X 3
Fred X X X 3
Gord X X X 3
Helen X X 2
Totals 2 2 3 5 5 4 2 23
Workshop
Part One:
Submission
Scheduling Part-time Bank Tellers
Tom Bailey is the Branch Manager at the Old Building Savings and Loan.
Tom is trying to schedule for next weeks operation. He has two full time
staff members and a few part timers. Utilizing the forecast below,
determine how many part timers Tom will have to schedule, and compose
a schedule for Tom.
7 5 6
Tellers required
2 3 4 1
0
Walk(ed)
Ethical issues
Legal issues
RevPAR generation
The Overbooking / No-show problem
“LIAT airlines serving Jonestown, Guyana is considering
overbooking its flights to avoid flying with empty seats. The
ticket agent is thinking of taking 7 reservations for an airplane
that has only 6 seats. He plans to give $50 cash
compensation, plus a seat on the next flight to anyone whose
reservation is not honoured.” Is this the best overbooking
policy?
All flight costs are fixed: If the plane flies, all costs are
incurred.
Method 1: The Payoff Matrix
No- Prob. Number of passengers Overbooked
Shows 0 1 2 3 4
0 30% 180
1 25% 180
2 20% 180
3 15% 180
4 10% 180
Expected Profit
If we have 1 no-show:
Maximum Net Income = $180
Revenue Loss due to no-show = 80
Net Income = $100
If we have 2 no-shows:
Maximum Net Income = $180
Revenue Loss due to no-shows = 160
Net Income = $ 20
Method 1: The Payoff Matrix
No- Prob. Number of passengers Overbooked
Shows 0 1 2 3 4
0 30% 180
1 25% 100 180
2 20% 20 180
3 15% -60 180
4 10% -140 180
Expected Profit
Continue Step 2:
For each no-show > overbook, we lose another $80.
LIAT Overbooking Problem
Assume everyone shows up
(including the overbooked passengers (OP))
Then:
CU X Prob (d≥x) ≥ CO X Prob (d<x)
CU X [1 - Prob (d<x)] ≥ CO X Prob (d<x)
Prob (d<x) ≤ CU
Cu = Cost of underbooking
CU + CO Co = Cost of overbooking
CU
The ratio CU + CO is known as the critical fractile.
Method 2: Critical Fractile
Let CU = Cost of losing 1 passenger
= $80 (lost fare due to underbooking) )
CU = 80 = 0.6154 = 61.5%
CU + CO 80 + 50
Method 2: Critical Fractile
No- Prob. Cum
shows Prob.
0 30% 30%
1 25% 55%
2 20% 75% 61.5%
3 15% 90%
4 10% 100%
Expected Profit
1. Add a Cumulative probability column. (d<X)
2. Critical Fractile = 61.5% (between 75% and 55%)
3. Answer: Go to next higher cumulative probability (75%)
Method 2: Critical Fractile
No need to calculate the payoff table…
Go right to the solution! No Prob. Cum
Shows Prob.
Steps:
1. Prepare cumulative probability 0 30% 30%
distribution 1 25% 55%
2. Calculate critical fractile
2 20% 75%
3. Solution corresponds to next 3 15% 90%
Higher cumulative probability
4 10% 100%
Workshop Part II :
Critical Fractile
Hotel example!
A small country inn is considering adopting an overbooking policy
due to a history of no-shows in the busy summer season. A
vacant room represents a loss of $69. However, providing a
confirmed guest a room at a nearby hotel costs $119. The hotel
still receives their room rate but pays the partner hotel the full
$119.
No Shows 0 1 2 3
Frequency 4 3 2 1
What is the optimal overbooking policy?
- Calculate using Critical Fractal Method and Payoff Matrix Method
Workshop Part III :
Critical Fractile
Service Shop example!
Jennies Quickie Lube has been noticing several instances
when customers do not show up for their service
appointments. She is also turning away customers due to
completely booked schedules. If a no-show costs Jennie
$100, and an overbook costs her a fee oil change ($20),
what should Jennie do?
No Shows 0 1 2 3
Frequency 10 30 20 10
What is the optimal overbooking policy?
- Calculate using Critical Fractal Method and Payoff Matrix Method
Critical Fractile Method
1. Prepare a cumulative probability distribution
No Shows 0 1 2 3 Total
Frequency 10 30 20 10 70
Probability 14% 43% 29% 14% 100%
Cum. Prob 14% 57% 86% 100%
3. The solution is ?
Queuing
Systems
Essential Features of Queuing Systems
Renege
Arrival Queue
process Departure
Calling Queue discipline Service
population configuration process
Balk No future
need for
service
12-53
Essential Features of Queuing Systems
Renege
Arrival Queue
process Departure
Calling Queue discipline Service
population configuration process
Balk No future
need for
service
12-54
Arrival Process
Arrival
process
Static Dynamic
12-55
Variation in Arrival Rates
Ambulance Calls Per Hour Patient Arrivals at Health Clinic
12-56
Poisson and Exponential Equivalence
Poisson distribution for number of arrivals per hour (top view)
One-hour
1 2 0 1 interval
Arrival Arrivals Arrivals Arrival
62 min.
40 min.
123 min.
12-57
Essential Features of Queuing Systems
Renege
Arrival Queue
process Departure
Calling Queue discipline Service
population configuration process
Balk No future
need for
service
12-58
Queue Configurations
12-59
Queue Configurations
Single-queue
◦ Advantages:
◦ The arrangement guarantees fairness by
ensuring that a first-come, first-served rule
(FCFS) applies to all.
◦ There is a single queue; thus, no anxiety is
associated with waiting to see if one
selected the fastest line.
◦ With only one entrance at the rear of the
queue, the problem of cutting-in is resolved
and reneging made difficult.
◦ Privacy is enhanced because the
transaction is conducted with no one
standing immediately behind the person
being served.
◦ This arrangement is more efficient in terms
of reducing the average time that
customers spend waiting in line.
12-60
Queue Configurations
Multiple-queue
◦ Advantages:
◦ Service provided can be differentiated.
◦ Ex. Supermarkets and lane 1
◦ Division of labour is possible.
◦ Season pass vs first time
◦ The customer has the option of selecting a
particular server of preference.
◦ Balking behavior may be deterred.
12-61
Queue Configurations
Take a Number
◦ Advantages:
◦ No need for a formal line.
◦ Customers are free to wander, possibly
increasing sales.
12-62
Essential Features of Queuing Systems
Renege
Arrival Queue
process Departure
Calling Queue discipline Service
population configuration process
Balk No future
need for
service
12-63
Queue Discipline
A queue discipline is a policy established by management pertaining to how to select the next
customer from the queue.
Static
Dynamic
(FCFS rule)
12-65
Essential Features of Queuing Systems
Renege
Arrival Queue
process Departure
Calling Queue discipline Service
population configuration process
Balk No future
need for
service
12-66
Service Facility Arrangements
Service facility Server arrangement
Parking lot Self-serve
Hospital Many service centers in parallel and series, not all used by each
patient
12-67
Queuing Analysis
Queuing Formulas
1. Mean arrival rate:
2. Mean service rate:
3. Mean number in service:
4. Probability of exactly “n” customers in the system:
5. Probability of “k” or more customers in the system:
6. Mean number of customers in the system: Ls = Lq + p (M/M/c)
Ls = / ( - ) (M/M/1)
7. Mean number of customers in queue:
(M/M/1)
Ws = Ls (M/M/c)
What is the probability of the ramp being available to pull right in?
What is the probability of the ramp being available to pull right in?
= 6/10 = 0.6
What is the probability of having at least 1 customer in the system upon
arrival?
◦ = ( / )1 = (6/10)1 = 0.6
What is the probability of the ramp being available to pull right in?
= 6/10 = 0.6
What is the probability of having at least 1 customer in the system upon
arrival?
◦ = ( / )1 = (6/10)1 = 0.6
What is the probability of the ramp being available to pull right in?
P0 = pn (1-p) = 0.60(1 – 0.6) = 1(0.4) = 0.4
What is the probability of the ramp being available to pull right in?
P0 = pn (1-p) = 0.60(1 – 0.6) = 1(0.4) = 0.4
Ls = Lq + p
= ? + 2.25
Lq for
Various
Values of
C and
Standard M/M/c Model
The Dean of CBE has assigned a secretary to each of its four departments. Each
secretary assists the faculty with class material and correspondence. The Dean
received complaints from the Economics faculty, about delays in getting work
accomplished. After collecting information on the requests of each secretary, it
was found that secretarial work arrives with a Poisson distribution at an
average rate of = 2 requests per hour for all departments except economics.
Economics has an average rate of = 3. The average time to complete a piece
of work is 15 minutes ( = 4 per hour). The current system is essentially four
M/M/1 operations.
What would be the average number of customers in the system if the Dean was
to pool all four secretaries?
Ls = Lq + p
= 0.31 + 2.25
= 2.56 per hour
Calling
Customer Counter Garage Car Wash Example
Population Q1. Thrifty Car Rental is looking at its products
Arrival and services. They have asked you to break
Process down the queue features for three of their
Queue
service offerings.
Configuration
Queue
Discipline
Service
Process
Foto Mat Example
Q2. The Foto-Mat is looking at their service processes. They have told you that on average 2 customers
arrive per hour at the Foto-Mat to process film. The one clerk in attendance spends an average of 15
minutes per customer. Given this information answer the following questions:
Q2.a. what is the arrival rate?
Q2.b. what is the service rate?
Q2.c. what is the average number of customers in service?
Q2.d. what is the probability of having at least 2 customers in the system upon arrival?
Q2.e. what is the average number of customers in the system?
Q2.f. what is the average number of customers in the queue?
Q2.g. what is the average waiting time in queue?
Airport Example
Q3. The Airport Runway is looking at its service times. The airports runway receives approximately 20
arrivals per hour, and each plane takes approximately 2 minutes to take off. Given this knowledge answer
the following questions.
Q3.a. Arrival rate =
Q3.b. Service rate =
Q3.c. What is the average number of customers in service?
Q3.d. What is the probability of having at least 3 planes in the queue upon arrival?
Q3.e. What is the average number of planes in the system and average number of planes in the queue?
Q3.f. What is the average waiting time the planes must spend in queue?
Q3.g. What is the average time that planes spend in the system?
Q3.h. What is the average time that planes spend in the system?
Questions
Service Operations
Analysis
HTM*3120
SESSION 9
Important Notes
1. Final Test opens March 19 and closes April 1, 2025.
1. Consists of:
1. 48 -52 Points
1. MC = 10 Points
2. Fill in the blank
Weekly Topics
Queuing Analysis Review
Forecasting Techniques
Exponential Smoothing
Example
Q1. Thrifty Car Rental is looking at its products
Queue Customer Counter Garage Car Wash
Features
Calling
Population
People Cars (things) Cars (things)
and services. They have asked you to break down
Arrival Facility Controlled (Appointments) Facility Controlled (Appointments) Static (Random arrival the queue features for three of their service
offerings.
Process rate varying with time)
Queue Dynamic (Selection based on Dynamic (selection based on status of Static (FCFS)
Discipline individual customer Attributes – queue - # customers waiting)
priority/pre-booking)
Service Servers in Parallel 2 stage (1st – dropping off car, 2nd – car Self-Serve
Process serviced, 3rd – car picked up)
Queuing Formulas
1. Mean arrival rate:
2. Mean service rate:
3. Mean number in service:
4. Probability of exactly “n” customers in the system:
5. Probability of “k” or more customers in the system:
6. Mean number of customers in the system: Ls = Lq + p (M/M/c)
Ls = / ( - ) (M/M/1)
7. Mean number of customers in queue:
(M/M/1)
Ws = Ls (M/M/c)
Demand (customers)
The number of potential buyers with the
interest and ability to purchase the
products sold by a business at the specific
price offered.
9
Importance of Demand
Forecasting
10
Importance of Demand
Forecasting
To forecast accurately, we use three types of data:
11
Historical Data
Historical Data
Common historical data tracked by RMs include
13
Historical Data
Common historical data tracked by RMs include
14
Historical Data
No-shows
Walk-ins
ADR achieved
15
Historical Data
Common historical data tracked by RMs include
Occupancy % achieved
• By the property
• By room type
Average number of guests per room
Average length of guest stay
16
Forecasting
RULE #1:
EVERY FORECAST IS
WRONG!!!
(ESPECIALLY IF IT’S ABOUT THE FUTURE)
Techniques for
Measuring Forecasting
Errors
How Wrong Can You Be?
(measuring forecast error)
Absolute Deviation
Sum of the Absolute Deviations (SAD)
Mean of the Absolute Deviations (MAD)
Mean Absolute Percentage Error (MAPE)
Mean Forecast Error (MFE)
Mean Squared Error (MSE)
Absolute Deviations
1. Absolute Deviation = | At – Ft |
2. Sum of the Absolute Deviations
SAD = Σ | At – Ft |
◦ Used when the total amount of error in a model is important
A t – Ft 100
MAPE = Σ At X n
MSE = Σ (At – Ft )2
n
◦ squaring makes a large number proportionately larger than a
small number
◦ i.e. 22 = 4, 32 = 9, 42 = 16, 52 = 25, etc.
◦ MSE is a good measure if managers don’t sweat the small stuff,
but are concerned with the larger forecast errors
Example: Calculating SAD & MAD
Actual vs
Forecast
t At Ft Abs.
t At Ft Dev.
1 136 150 1 136 150 14
2 151 160 2 151 160 9
3 185 165 20
3 185 165
4 144 150 6
4 144 150
5 127 150 23
5 127 150 6 183 160 23
6 183 160 7 172 165 7
7 172 165 8 158 160 2 104
8
SAD 104
8 158 160
MAD 13
Example: Calculating MAPE
Actual vs
Forecast t At Ft Abs. Abs.
Dev. % error |151 -160 |
t At Ft
1 136 150 14 10.29 151
1 136 150
2 151 160 9 5.96
2 151 160
3 185 165 20 10.81
3 185 165
4 144 150 6 4.17
4 144 150
5 127 150 23 18.11
5 127 150
6 183 160 23 12.57
6 183 160
7 172 165 7 4.07
7 172 165
8 158 160 2 1.27 67.25
8 158 160
Σ Percentage error 67.25 8
MAPE 8.41
Example: Calculating MFE
Actual vs
t At Ft Dev.
Forecast (error)
t At Ft 1 136 150 -14
1 136 150 2 151 160 -9
2 151 160 3 185 165 +20
3 185 165 4 144 150 -6
4 144 150 5 127 150 -23
5 127 150 6 183 160 +23
6 183 160 7 172 165 +7
7 172 165 8 158 160 -2 -4.0
8 158 160 Σ Forecast errors -4.0 8
MFE -0.5
Example: Calculating MSE
Actual vs
Forecast
t At Ft Dev. Dev2
t At Ft (error) (error2)
1 136 150 1 136 150 -14 196
2 151 160 2 151 160 -9 81
3 185 165 3 185 165 +20 400
4 144 150 4 144 150 -6 36
5 127 150 5 127 150 -23 529
6 183 160 6 183 160 +23 529
7 172 165 7 172 165 +7 49
8 158 160 8 158 160 -2 4
Σ Squared error 1,824
MSE 228
Forecasting Techniques
Forecasting Techniques
1. Delphi Technique
◦ Expert panels (managers, staff and external advisors)
2. Associative Methods
◦ Regression
3. Time Series
◦ Moving average (MA)
◦ Exponential smoothing (S)
◦ Trend adjustment (T)
◦ Seasonal adjustment (I)
Delphi Techniques
◦ Expert panels (managers, staff and external advisors)
◦ The use of a series of well constructed questionnaires collected from a panel of experts in
their field.
◦ Objectives of the Delphi Technique/Method:
1. “To determine or develop a range of possible program alternatives;
2. To explore or expose underlying assumptions or information leading to different judgments;
3. To seek out information which may generate a consensus on the part of the respondent group;
4. To correlate informed judgments on a topic spanning a wide range of disciplines, and;
5. To educate the respondent group as to the diverse and interrelated aspects of the topic” (Delbecq,
Van de Ven, and Gustafson, 1975, p. 11).
Associative Methods
◦ Regression
◦ Multiple Regression
Simple Linear Regression (SLR)
Regression is fitting a line to data points using statistical methods to get the
best fit.
1 = Δy / Δx
y = 0 + 1 x, where: = slope
0 = intercept
y
data point (x,y)
Δy
a0
Δx
0 a1
x
If we know the value of parameters 0 and 1, we
can calculate a forecasted value of y for any x.
Multiple Linear Regression (MLR)
Same as simple Linear regression, except the line is in n-dimensional
space (multiple independent variables)
y = 0 + 1x1 + 2x2 + 3x3 + …..
SLR Example:
A local restaurant suspects that sales are related to local employment, as measured in area
payroll data (in Billions of dollars).
Year
2005 2006 2007 2008 2009 2010
a0
y = 0 + 1 x, where:
a1
SLR Example:
A local restaurant suspects that sales are related to local employment,
as measured in area payroll data (in Billions of dollars).
Year
2005 2006 2007 2008 2009 2010
y= 0 + 1 x
= 1.75 + (0.25 x 6)
= $3.25 Million
MLR Example
A local restaurant suspects that sales (millions) are related to local employment, as measured in
payroll data (in Billions of dollars) and mortgage interest rates
Year
2005 2006 2007 2008 2009 2010
y = 0 + 1 x1 + 2 x2
= 2.13 + (0.24 x 6) - (6.2 x .03)
= $3.38 Million
Problems with Regression Approaches
Great when causative factors are known with certainty…
But often based on other estimates.. For example, area payroll and mortgage interest rates,
weather, etc. are all forecasts that could be wrong.. Or simply unpredictable
Time Series Models
◦ Moving Averages
◦ Exponential Smoothing
Time Series Forecasting
Based on the idea that the past is our best predictor of the future
Data collected over a sequence of evenly spaced time periods has a lot of information:
◦ Yesterday’s performance
Characteristics:
Needs N observations to make a forecast
Very inexpensive and easy to understand
Gives equal weight to all observations
Does not consider observations older than N periods
The average of the past 3 months is the best predictor of
what will happen next month….
Ft = MAt-1
Period Sales 3 Month Forecast Dev.
t At Average Ft (error)
1 10 ~ ~ ~
2 12 ~ ~ ~
MA3 = 10 + 12 + 13
3 13 11.67 ~ ~
3
4 16 13.67 11.67 4.33
5 19 16.00 13.67 5.33
6 23 19.33 16.00 7.00 MA4 = 12 + 13 + 16
7 26 22.67 19.33 6.67
3
8 30 26.33 22.67 7.33
9 28 28.00 26.33 1.67
10 18 25.33 28.00 10.00 MA10 = 30 + 28 + 18
11 16 20.67 25.33 9.33 3
12 14 16.00 20.67 6.67
SAD 58.33
MAD 6.48
What is going on…
We are using the 3 preceding period data to estimate the future
Every period has the same weight or importance
49
Moving averages
How long a period should I use?
t=1 period 1
t=7 period 7
n = the number of periods in the model
This:
Ft = Ft-1 + (At-1 – Ft-1)
Becomes:
St = St-1 + (At – St-1)
and Ft+1 = St
Recall: Ft+1 = St
and thus: Ft = St-1
St = At + (1- ) St-1
An example calculation of St:
St = At + (1- ) St-1
Period Sales
t At St
…. ..... ….
= 0.7
2 12 11.40
3 13 12.52 Calculate S3, then S4
4 16 14.96
Ft = St-1
7 26
8 30
9 28
10 18
11 16
12 14
Here’s how it’s done!!
Period Sales Forecast Dev.
t At St Ft (error) We set S1 = A1
1 10 10** ~ ~ to start since
2 12 10.0 there is no prior
3 13 data available.
4 16
5 19
Set Ft = St-1
6 23
7 26
8 30 = 10
9
10
28
18
Then.. F2 = S1
11 16 = 10
12 14
SAD
MAD
Here’s how it’s done!!
Period Sales Forecast Dev.
t At St Ft (error) We calculate the
1 10 10** ~ ~ Value of S2 using the
2 12 11.40 10.0 formula:
3 13 11.40 St = At + (1- ) St-1
4 16 S2 = 0.7 X 12
5 19 + (0.3 ) X 10
6 23
= 11.40
7 26
8 30
9
10
28
18
Ft = St-1
11 16 F3 = S2 = 11.40
12 14
SAD
MAD
That was fun.. Let’s do it again!!
Period Sales Forecast Dev.
t At St Ft (error) We calculate the
1 10 10** ~ ~ Value of S3 using the
2 12 11.40 10.0 formula:
3 13 12.52 11.40 St = At + (1- ) St-1
4 16 12.52 S3 = 0.7 X 13
5 19 + (0.3 ) X 11.40
6 23
7 26 = 12.52
8 30
9 28
10 18
Ft = St-1
F4 = S3 = 12.52
11 16
12 14
SAD 45.32
MAD 4.12
Go ahead.. Knock yourself out!
Simple Exponential Smoothing with = 0.7
Period Sales Forecast Dev.
t At St Ft (error) We set St=1 = At=1
1 10 10** ~ ~ to start since
2 12 11.40 10.00 2.00 there is no prior
3 13 12.52 11.40 1.60 data available.
4 16 14.96 12.52 3.48
5 19 17.79 14.96 4.04
6 23 21.44 17.79 5.21
Ft = St-1
7 26 24.63 21.44 4.56
8 30 28.39 24.63 5.37
9 28 28.12 28.39 0.39
10 18 21.04 28.12 10.12
11 16 17.51 21.04 5.04
12 14 15.05 17.51 3.51
SAD 45.32
MAD 4.12
How do you find the value for ?
◦ New Forecast
= Last period’s forecast
+ (Last Period’s Actual demand – Last Period’s forecast)
the following
4 116
5 119
6
7
123
126 sales.
8 130
9 128
10 118
SAD
MAD
Questions
◦ Project Management
◦ Gantt Charting
◦ Critical Path Management (CPM)
Service Operations
Analysis
HTM*3120
SESSION 8B
Session Topics
◦ Queuing Systems
◦ Queuing Analysis
Essential Features of Queuing Systems
Renege
Arrival Queue
process Departure
Calling Queue discipline Service
population configuration process
Balk No future
need for
service
12-3
Essential Features of Queuing Systems
Renege
Arrival Queue
process Departure
Calling Queue discipline Service
population configuration process
Balk No future
need for
service
12-4
Arrival Process
Arrival
process
Static Dynamic
12-5
Variation in Arrival Rates
Ambulance Calls Per Hour Patient Arrivals at Health Clinic
12-6
Poisson and Exponential Equivalence
Poisson distribution for number of arrivals per hour (top view)
One-hour
1 2 0 1 interval
Arrival Arrivals Arrivals Arrival
62 min.
40 min.
123 min.
12-7
Essential Features of Queuing Systems
Renege
Arrival Queue
process Departure
Calling Queue discipline Service
population configuration process
Balk No future
need for
service
12-8
Queue Configurations
12-9
Queue Configurations
Single-queue
◦ Advantages:
◦ The arrangement guarantees fairness by
ensuring that a first-come, first-served rule
(FCFS) applies to all.
◦ There is a single queue; thus, no anxiety is
associated with waiting to see if one
selected the fastest line.
◦ With only one entrance at the rear of the
queue, the problem of cutting-in is resolved
and reneging made difficult.
◦ Privacy is enhanced because the
transaction is conducted with no one
standing immediately behind the person
being served.
◦ This arrangement is more efficient in terms
of reducing the average time that
customers spend waiting in line.
12-10
Queue Configurations
Multiple-queue
◦ Advantages:
◦ Service provided can be differentiated.
◦ Ex. Supermarkets and lane 1
◦ Division of labour is possible.
◦ Season pass vs first time
◦ The customer has the option of selecting a
particular server of preference.
◦ Balking behavior may be deterred.
12-11
Queue Configurations
Take a Number
◦ Advantages:
◦ No need for a formal line.
◦ Customers are free to wander, possibly
increasing sales.
12-12
Essential Features of Queuing Systems
Renege
Arrival Queue
process Departure
Calling Queue discipline Service
population configuration process
Balk No future
need for
service
12-13
Queue Discipline
A queue discipline is a policy established by management pertaining to
how to select the next customer from the queue.
Static
Dynamic
(FCFS rule)
12-15
Essential Features of Queuing Systems
Renege
Arrival Queue
process Departure
Calling Queue discipline Service
population configuration process
Balk No future
need for
service
12-16
Service Facility Arrangements
Service facility Server arrangement
Parking lot Self-serve
Hospital Many service centers in parallel and series, not all used by each
patient
12-17
Queuing Analysis
Queuing Formulas
1. Mean arrival rate:
2. Mean service rate:
3. Mean number in service:
4. Probability of exactly “n” customers in the system:
5. Probability of “k” or more customers in the system:
6. Mean number of customers in the system: Ls = Lq + p (M/M/c)
Ls = / ( - ) (M/M/1)
7. Mean number of customers in queue:
(M/M/1)
Ws = Ls (M/M/c)
What is the probability of the ramp being available to pull right in?
What is the probability of the ramp being available to pull right in?
= 6/10 = 0.6
What is the probability of having at least 1 customer in the system upon
arrival?
◦ = ( / )1 = (6/10)1 = 0.6
What is the probability of the ramp being available to pull right in?
= 6/10 = 0.6
What is the probability of having at least 1 customer in the system upon
arrival?
◦ = ( / )1 = (6/10)1 = 0.6
What is the probability of the ramp being available to pull right in?
P0 = pn (1-p) = 0.60(1 – 0.6) = 1(0.4) = 0.4
What is the probability of the ramp being available to pull right in?
P0 = pn (1-p) = 0.60(1 – 0.6) = 1(0.4) = 0.4
Ls = Lq + p
= ? + 2.25
Lq for
Various
Values of
C and
Standard M/M/c Model
The Dean of CBE has assigned a secretary to each of its four departments. Each
secretary assists the faculty with class material and correspondence. The Dean
received complaints from the Economics faculty, about delays in getting work
accomplished. After collecting information on the requests of each secretary, it
was found that secretarial work arrives with a Poisson distribution at an
average rate of = 2 requests per hour for all departments except economics.
Economics has an average rate of = 3. The average time to complete a piece
of work is 15 minutes ( = 4 per hour). The current system is essentially four
M/M/1 operations.
What would be the average number of customers in the system if the Dean was
to pool all four secretaries?
Ls = Lq + p
= 0.31 + 2.25
= 2.56 per hour
15-4
Project Management
Questions
What activities are required to complete a project
and in what sequence?
When should each activity be scheduled to begin and
end?
Which activities are critical to completing the project
on time?
What is the probability of meeting the project
completion due date?
How should resources be allocated
to activities?
16-5
Sources of Unexpected Problems
16-6
Three Types of Project
Management Techniques
Gantt Charting
Critical Path Management (CPM)
Project Evaluation and Review Technique (PERT)
Gantt Charts
Developed by Henry Gantt in 1916
Determines the timing of individual tasks or activities within a project
Plots a time line for each activity across a time line for the project
A graphic representation of the work breakdown structure..
Gantt Chart for Tennis
Tournament
ID Activity Days Day of Project Schedule
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
A Negotiate for 2
Location
B Contact Seeded 8
Players
C Plan Promotion 3
D Locate Officials 2
E Send RSVP 10
Invitations
F Sign Player 4
Contracts
G Purchase Balls 4
and Trophies
H Negotiate 1
Catering
I Prepare Location 3
J Tournament 2
Personnel Required 2 2 2 2 2 3 3 3 3 3 3 2 1 1 1 2 1 1 1 1
Problems with Gantt Charts
Do not show interdependence of activities
Unwieldy and awkward for complex projects because the value lies in
seeing the whole project at once, and paper size limits that ability
Identifies the earliest and latest start and finish times for each activity
A C D G
2 3 2 4
Start E I J
10 3 2
B F H
8 4 1
Some CPM notation…
TS
ES = earliest start time
EF = earliest finish time
LS = latest start time
LF = latest finish time
ES EF
TS = total slack
= LF – EF
= LS – ES
LS LF
CPM Scheduling Formulas
ES = EFpredecessor (max) (1)
EF = ES + t (completion time) (2)
LF = LSsuccessor (minimum) (3)
LS = LF - t (completion time) (4)
TS = LF - EF (5)
or TS = LS - ES (6)
The “Forward Pass”
Begin by setting the Earliest Start time for the Start = 0. Since the Start has
no completion time, the Earliest Finish for the start also = 0.
The earliest start time (ES) = 0 for the activities that begin the project, A
(Location Contract) and B (contact Players).
A (Location Contract) ES = 0
B (Contact Players) ES = 0
The Earliest Finish time becomes the Earliest Start time for the next activity.
Continue….
Step 2: The forward pass…
ES 0 2 EF = ES + completion time
= 0 + 2
A C D G
2 3 2 4
EF
0 0
Start E I J
10 3 2
TS B F H
8 4 1
ES EF
LS LF
Step 2: The forward pass…
2+3=5 5+2=7 7+ 4 = 11
0 2 2 5 5 7 7 11
A C D G
2 3 2 4
0 0 5 15 5 + 10 = 15
Start E I J
10 3 2
TS
ES EF
B F H
8 4 1
LS LF
Step 2: The forward pass…
0 2 2 5 5 7 7 11
What’s
going
A C D G on
2 3 2 4 here?
0 0 5 15 15 18
Start E I J
10 3 2
TS B F H
8 4 1
ES EF
LS LF
What’s Both E and G precede
going activity I.
on
here? Activity I cannot begin
until the activity with
5 7 7 11
the latest Early Finish
D G time is complete.
2 4
TS
18 20 time for activity I.
ES EF H
LS LF 1
Forward Pass Rule:
Whenever an activity (z) has two (2) or more predecessor
activities (x, y), the Earliest Start time of z is the largest earliest
finish time of the predecessor (x, y) activities
Predecessors z
y
Step 2: The forward pass…
0 2 2 5 5 7 7 11
A C D G
2 3 2 4
0 0 5 15 15 18
Start E I J
10 3 2
0 8
8 12 18 20
B F H
8 4 1
TS
15 16
ES EF Don’t forget the activities in the lower
LS LF part of the network!!
The “Backward Pass”
After the forward pass is completed, we begin the Backward Pass.
1. The earliest finish time (EF) of the final step becomes the latest finish
time (LF) of the previous step.
0 0 5 15 15 18
Start E I J
10 3 2
0 8 3. TS = LF - EF 0
8 12 18 20
18 20
B F H
8 4 1
TS
ES EF 2. LS = LF – completion time 15 16
LS LF = 20 – 2 = 18
Step 3: The backward pass…
0 2 2 5 5 7 7 11
TS = LF - EF
A C D G = 18 -18 = 0
2 3 2 4
0
0 0 5 15 15 18
15 18
Start E I J
10 3 2
0 8 0
8 12 18 20
18 20
B F H
8 4 1
TS 2
ES EF TS = LF - EF 15 16
= 18 -16 = 2 17 18
LS LF
Step 3: The backward pass… 4
0 2 2 5 5 7 7 11
11 15
A C D G
2 3 2 4
0 0
0 0 5 15 15 18
What’s 5 15 15 18
going
Start on E I J
here? 10 3 2
0 8 0
8 12 18 20
18 20
F H
4 1
TS 2
ES EF 15 16
LS LF 17 18
Both I and H follow
0 0 activity E.
5 15 15 18 The LF of Activity E
5 15 15 18
cannot be earlier than
E I the earliest LS of I and
10 3
H.
LSI = 15, LSH = 17, We
H use the earliest start
1
2 time from activity I as
15 16 the Latest Finish time
TS
17 18
for activity E.
ES EF
LS LF
Backward Pass Rule
Whenever an activity (z) has two (2) or more following
(successor) activities (x, y), the Latest Finish time of z is the
smallest Latest Start time of the successor (x, y) activities
LF = LSsuccessor x or y (minimum)
Z x
Successor
Activities
TS
ES EF y
LS LF
Step 3: The backward pass…
0 0 4 4
0 2 2 5 5 7 7 11
0 2 2 5 9 11 11 15
A C D G
2 3 2 4
0 0 0
0 0 5 15 15 18
0 0 5 15 15 18
Start E I J
10 3 2
5
5 0
0 8
8 12 18 20
5 13
13 17 18 20
B F H
TS 8 4 1
2
ES EF
15 16
LS LF 17 18
Step 3: The backward pass…
0 0 4 4
0 2 2 5 5 7 7 11
0 2 2 5 9 11 11 15
A C D G
2 3 2 4
0 0 0
0 0 5 15 15 18
0 0 5 15 15 18
Start E I J
10 3 2
5
5 0
0 8
8 12 18 20
5 13
13 17 18 20
B F H
TS 8 4 1
2
ES EF
15 16
LS LF 17 18
Identify the Critical Path…
The critical path is the sequence of activities with TS = 0.
TS
ES EF
LS LF
If the path is incomplete from start to finish.. you have made a mistake!
Step 4: The Critical Path
0 0 4 4
0 2 2 5 5 7 7 11
0 2 2 5 9 11 11 15
A C D G
2 3 2 4
0 0 0
0 0 5 15 15 18
0 0 5 15 15 18
Start E I J
10 3 2
5
5 0
0 8
8 12 18 20
5 13
13 17 18 20
TS B F H
ES EF 8 4 1
2
LS LF 15 16
17 18
Critical Path: A→C→E→I→J
Tennis Tournament
Activity Code Predecessor Time
Location contract A - 2 days 2
Contact players B - 8 days
Plan promotion C A 3 days 3
Locate Officials D C 2 days
Send Invites E C 10 days 10
Buy trophies F B&C 4 days
Player Contracts G D 4 days
Catering Contract H E&F 1 days
Set-up Location I E&G 3 days 3
Run tournament J H&I 2 days 2
Minimum completion time 20
The Tennis Tournament…
conclusions
1. It takes 20 days to organise and run.
2. We need to supervise A, C, E, I & J activities very carefully (no slack).
If any of these steps are delayed, the tournament will be delayed.
3. All other activities have varying amounts of slack… and are less
critical.
4. Earliest and latest start and finish times help managers keep the
project on track.
Workshop
Application of Knowledge
A local event company is planning their end of the year event. They have
provided you a work breakdown and asked you for the following
information:
Activity Time (days) Predecessor
1. a CPM network A 4 ~
B 3 ~
2. calculation of the earliest
C 4 ~
Start, Finish and Latest
Start, Finish and slack D 6 A
time for each activity. E 3 A
3. Identification of the F 5 C
Critical Path and G 4 D
statement of the H 6 A, B, F
completion time.
I 2 E, G, H
Step 1: The Model
A D G
4 6 4
I
B E 2
Start 3 3
C F H
TS 4 5 6
ES EF
LS LF
Yield
Management
What is Yield Management?
Optimization of profit by jointly maximising capacity
utilization and average price
Rate efficiency is often in the form of average rate, average check, average
price, etc.
◦Pricing Tools
◦Capacity Tools
Pricing Tools
1. General Pricing
2. Demand-based Pricing
3. Nested Pricing
Pricing Tools - General Pricing
A single-price structure
Everyone pays the same price, regardless of time of
day, time of booking, etc.
Pricing Tools –
General Price-Setting Goals
Set the price such that all capacity is sold and revenue is
maximized.
◦ Unsold capacity is wasted
◦ Price is too low if demand exceeds capacity
◦ Price is too high if capacity is unsold
◦ The easiest way to make money is to get your customer to give it to you!
Pricing Tools –
Demand-based Pricing:
◦ Higher prices charged during busy periods
◦ Discounts during low volume periods
◦ Price-sensitive customers shift from busy periods to slow
periods
◦ Time-sensitive customers pay more to go when they
want to go
◦ Low industry margins (high variable costs) reduce the
ability to discount.. (restaurants vs. airlines)
Pricing Tools - Nested Pricing
◦ Charge different prices for the same product sold at the same time
(differential pricing)
◦ Airline seats: people sitting next to each other pay different prices!
◦ Increase the average price by selling as many seats as possible to
time-sensitive buyers at higher prices
◦ Increase capacity utilization by attracting price-sensitive buyers with
discounts to fill capacity
◦ Manage the average price by limiting the number of seats sold at
lower prices
Nested Pricing
Perception of unfairness among consumers:
◦ Early booking gets the lowest price is generally accepted as fair (a variant of
the first-come first-served protocol)
◦ If a single, general price is set so that the aircraft is always full (capacity is
optimized), there are no seats available for “last minute” travelers.
◦ A few, “full fare” seats are only available because of the high prices charged
and, there is a possibility that these seats will be vacant (loss to the airline)
◦ Stand-by top-ups (the lowest fare class) are primarily used as perks for
airline employees, or students who are willing to wait around airports until
such a seat is available
Unfairness?
It serves travelers on a budget extremely well:
◦ If a single, general price is set so that the aircraft is always full (capacity is
optimized), budget travelers may not travel, travel less often, or not take
their children with them
Fares available:
Full-fare: $2,000 per seat
Economy: $1,200 per seat
Super-saver: $ 750 per seat
It can be done for as many rates as you have demand data for…
Virtual nesting..
◦ Computationally intensive
◦ Algorithm was invented in 1987 by Peter Belobaba, a Canadian PhD student at MIT.
Low -Tech Price and Capacity Tool
Before Belobaba s algorithm, a low-tech methodology was in common
use to solve the price and capacity decisions for capacity-constrained
industries
No-shows
No of Bookings
200 0
Days before customer arrives for service
Step 1: Plot the Booking
Curve
What is a Booking Curve?
No-shows
No of Bookings
200 0
Days before customer arrives for service
Step 2: Put Upper and Lower
bounds on the booking curve
Historical average bookings
- 10%
+ 20%
No of Bookings
- 20%
+ 10%
200 0
Days before customer arrives for service
Step 2: Put Upper and Lower
bounds
on the booking curve
Historical average bookings
- 10%
+ 20%
No of Bookings
- 20%
+ 10%
200 0
Days before customer arrives for service
Step 3: Plot actual bookings
against historical booking data
In this case, we are 120 days before customers arrive, and bookings are
10% higher than last year
+ 20%
No of Bookings
- 20%
+ 10%
200 120 0
Days before customer arrives for service
Step 3: Compare actual bookings
against historical booking data
Boundaries signal rate changes:
◦ When actual bookings are +10%, we increase rates 1 step.
+ 20%
No of Bookings
- 20%
+ 10%
200 120 0
Days before customer arrives for service
Step 3: Compare actual bookings
against historical booking data
Boundaries signal rate changes:
◦ When actual bookings are the same, rate stays the same
+ 20%
No of Bookings
- 20%
+ 10%
200 120 0
Days before customer arrives for service
Step 3: Compare actual bookings
against historical booking data
Boundaries signal rate changes:
◦ When actual bookings are +20%, we increase rates 2 steps.
+ 20%
No of Bookings
- 20%
+ 10%
200 120 0
Step 3: Compare actual bookings
against historical booking data
Boundaries signal rate changes:
◦ When actual bookings are -10%, we decrease rates 1 step.
+ 20%
No of Bookings
- 20%
+ 10%
200 120 0
Days before customer arrives for service
Booking Curve Method
Booking curves are plotted using Excel, based on historical data for the
average number of bookings on hand for each day prior to arrival.
Higher rates decrease the number of bookings, lower rates increase the
number of bookings
Yield Statistics
REVPAR (Revenue per Available Room)
Total Revenue
= REVPAR X # of Rooms available
= $225 X 100
= $22,500
REVPAR Math….
If a hotel has REVPAR = $225, and occupancy of 75%, what is the
Average Daily Rate?
Variable costs have an impact on Profit, because rooms not sold are
rooms that do not contribute to variable costs
Expenses
Variable Costs ($14/room) 1,400 1,050 1,400
Gross Operating Income 4,600 4,950 4,900
Expenses
Variable Costs ($14/room) 1,400 1,050 1,400
Gross Operating Income 4,600 4,950 4,900
Expenses
Variable Costs ($14/room) 1,400 1,050 1,400
Gross Operating Income 4,600 4,950 4,900
200
75
200
75
Quantity
150
$225 Price
The role of Revenue Management?
Revenue Managers operate within the area where prices are
neither too high or too low, and rooms supply matches demand
in that range
Rooms not
wanted
200 Zone of Maximum
75 Revenue Potential
Rooms not
offered
Price:Premium Price
Regular Price Average Price
Discounted (ADR)
Quantity: Inventory
-Type of Item Utilization
-Quantity of item (Occupancy)
How do managers increase profits?
Revenue
- Variable costs
- Fixed Costs
= Net Income
“Revenue management (RM) is the application of
information systems and pricing strategies to allocate the
What is right capacity to the right customer at the right place at
the right time” (Kimes and Wirtz, 2015, p. 2).
revenue
management The act of skillfully, carefully, and tactfully managing,
? controlling, and directing capacity and sources of income,
given the constraints of supply and demand.
•Tranter, Stuart-Hill and Parker
Revenue Management is a dynamic
process
◦ Situations change
◦ Markets change
◦ Opportunities change
◦ You may have been wrong and you might learn something new
1 2 3
Understand the Understand the many Become better at
importance of complex factors that making revenue
revenue management influence revenue management
management strategy decisions than their
and tactics competitors
Revenue
Management
Cycle
Forecasting
Differential Pricing
Strategic Pricing
Negotiating Skills
Inventory and Price
Management
Displacement Analysis
Distribution Channels
Inventory and Price Management
Performance metrics
Competitive fair market
share and market penetration
Utilizing performance metrics
Calculating internal and external
benchmarking
Understanding the challenges of
revenue performance Maximizing Revenue Optimization
measurement Strategic Pricing & Displacement Analysis
Restaurant Revenue Management
Revenue Management outside of hotels and restaurants
The Best conditions for
Revenue Management
Fixed capacity (short – medium term)
◦ Difficult to adjust to fit current demand
Perishable Products
Fitness
Issue Hotel Restaurant
Centre
SUPPLY CONSTRAINT Hard Soft Soft
ABILITY TO INCREASE
None Limited Limited
SUPPLY
ABILITY TO DECREASE
None Limited Limited
SUPPLY
Hospitality Industry Characteristics
Revenue Management Characteristics in the Hospitality Industry
work?
◦ How big are the segments?
What makes revenue
management work?
◦ Effectively Managing Segments
◦ Prevent those who would pay more from paying less
◦ The ability to distinguish
◦ The ability to separate
Remember the
◦ The perception of fairness Critical Fractile
◦ Long-term effects
◦ Customers learn the system
◦ Perceptions of fairness leading to dissatisfaction
The role of segmenting demand
Are the people willing to pay $300 the same as the
people who pay $150?
Quantity
200
75
for Revenue 4 Save your products for your most valuable customers
Management
5 Make decision based on knowledge, not supposition
6 Exploit each product’s value cycle
7 Continually evaluate your revenue opportunities
#1. Focus on price when
balancing supply and demand
Equilibrium points
◦ Exist for each market segment and product
◦ Identify where supply and demand produces optimal returns
#1. Focus on price when balancing
supply and demand
Conventional Wisdom
◦ In times of high demand, increase capacity
◦ In times of low demand, decrease capacity
Entropic Event:
◦ Demand fluctuations grow in frequency and intensity
RM Tactic:
◦ Address short term fluctuations with price, then capacity
#2. Replace cost-based pricing with
market based pricing
Customers do not care about an operations costs.
Customers care about:
◦ Availability of alternatives from competitors
◦ Amount of disposable income
◦ Urgency or need (real or perceived) for the product.
#2. Replace cost-based pricing with
market based pricing
Conventional Wisdom
◦ Set prices to cover costs and provide an acceptable profit margin.
Entropic Event:
◦ Nonconformist consumers determine the price they are willing to pay; market provides numerous
choices.
RM Tactic:
◦ Forget cost-based pricing. Set prices consumers will accept in a price-flexible environment; reduce
costs, if necessary, to meet margin requirements.
#3. Sell to segmented
micromarkets instead of mass
markets
“Market Segmentation is the key to market-based pricing and revenue
maximization ” Robert G Cross
#3. Sell to segmented micromarkets
instead of mass markets
Entropic Event:
◦ Consumer individualism shatters the mass market.
RM Tactic:
◦ Different segments demand different prices. To maximize revenue and stay
competitive, prices must vary to meet the price sensitivity of each market
segment.
#4. Save your products for your most
valuable customers
Entropic Event:
◦ Traditional business practices don t satisfy investor demands for aggressive
revenue growth.
RM Tactic:
◦ Understand demand at the micro-market level as accurately as possible, and
save products for the most valuable customers to achieve optimum revenue.
#5. Make decision based on knowledge,
not supposition
Humans Computers
◦ Intuitive ◦ Logical
◦ Creative ◦ Mindless
◦ Biased ◦ Indifferent
◦ Need to sleep ◦ Tireless
Entropic Event:
◦ Nonconformist consumers are continually fragmenting the market and
changing buying behavior.
RM Tactic:
◦ Forecast demand at the micro-market level to gain knowledge of subtle
changes in consumer behavior patterns.
#6. Exploit each product s value cycle
“Generate maximum
revenue by
understanding the
value cycle and
optimally timing the
availability and price
of the product to each
micro-market
segment.”
Robert G. Cross
#6. Exploit each product s value cycle
To understand the value cycle, businesses need to:
1. Break their business down into logical stages (sub-markets)
2. Project a revenue trajectory for each stage
3. Determine the optimal time to launch the subsequent stage
Entropic Event:
◦ Rapidly changing market conditions defy traditional approaches.
RM Tactic:
◦ Generate maximum revenue by understanding the value cycle and optimally
timing the availability and price of the product to each micro-market
segment.
#7. Continually evaluate your revenue
opportunities
◦ Utilize acquired knowledge to continually evaluate your market and make changes accordingly.
◦ Shorten the timeframe in which data is gathered, synthesized and used to make changes to the
operation.
◦ Get data into the hands of employees at all levels of the organization.
#7. Continually evaluate your revenue
opportunities
Conventional Wisdom
◦ Information in the hands of a top manager ensures that the best decisions
will be made for the company.
Entropic Event:
◦ Breakdown of the mass market occurs, and the need for fast responses at
the micro-market level increases.
RM Tactic:
◦ Give decisions-support tools to the workers in the trenches to make dynamic
decisions at the micro-markets level.
Perishable products and opportunities
No-Shows 0 1 2 3 4
Frequency 32 21 16 7 4
SLR Example:
A local restaurant would like to know their sales if their wages increase to
$350,000. They have calculated a SLR of 2.24 and the intercept to be $180,000.
Complete the
Table
Mondays Rooms Sold Forecast (Ft) Actual Dev Abs Dev
1.00 42.00
2.00 34.00
3.00 39.00 The 90 room Trail Top Inn is
4.00 44.00
looking at their rooms sales for the
last eight Mondays.
5.00 30.00
6.00 22.00 Using the information they have
provided, calculate a forecast using
7.00 44.00
a two-day moving average.
8.00 49.00
SAD
Also calculate the Trail Top Inns
SAD, MAD, MFE, and MSE.
MAD
MFE
MSE
Toms Groceries
Toms groceries checkout counter is busy on the weekends. Tom has asked you to have a look at
his wait times and provide him your insights. He has told you that on average 6 customers arrive
per hour and that it takes an average of 8 minutes to serve one customer. He has provided a few
questions for you below:
Arrival rate =
Service rate =
What is the probability of having at least 2 customers in the system upon arrival?
What is the average number of customers in queue and average number of customers in the system?