Professional Documents
Culture Documents
Gordo Case - Queueing Analysis
Gordo Case - Queueing Analysis
Gordo Case - Queueing Analysis
INTRODUCTION
Gordo’s Fast Foods approved to open a new franchise in Muntinlupa city, Metro
Manila. This new store will include a drive-up window service that will include an
intercom station. The customers can use the drive-up window to order at a service
window to which customers will drive up and pay and receive their orders.
Being the first of Gordo’s Fast Foods with a drive-thru window, the
management has not design the drive-thru window. The design has to
consider maximum efficiency and profitability.
The franchisee has identified three possible design options for the drive-thru window. The
activities performed by each service window in accomplishing the customer’s order are:
1. Take customer’s order
2. Take customer’s payment
3. Give the customer’s receipt and change
4. Fulfill the order
5. Provide the order to the customer
2
Based on the activities, the three designs are based on number of service windows and
number of servers to handle the activities of a service window. The table below describes
each design option.
Arrival
Scenario Service Time
Time
1 Customer is served in 1
minute and 15 seconds
Option
1 service window with 1 employee Or
1
48 Customers is served in 1 1
Hour Customer
Hour 30
Customer
2 service windows with 1 employee each. This
1 Customer is served in 1 arrive
will operate in the same manner as option 1.
minute and 15 seconds every 1
Option
Or hour
3 Arriving customers will queue in a single line and
48 Customers is served in 1
move to the first window that will become
Hour
available when they reach the head of the line.
In addition, the management has identified costs that should be considered with
analyzing the optimal design option.
D. Assumptions
It is assumed that the following factors will be considered for the analysis in order
to determine the best choice among the three options for Gordo Fast Food
Franchise. These factors are:
The following are the characteristics of the queuing system for the analysis which
was derived of the franchise’s current dilemma:
Poisson arrival process was used for the arrival pattern characteristic since generally
number of arrivals per unit of time at a service facility can be defined by a Poisson
distribution. On the other hand, Negative exponential distribution was used for
service time distribution since in the field of queuing, this distribution was been used
the most frequent (Taylor III, 2013).
The population size used was infinite at source due to the huge market of customers
in the vicinity of Muntinlupa city. For the queue discipline, FCFS was used since in
this line of business, customers are served based on their order in the queue.
B. Results
After applying the variables for each respective option and integrating M/M/1 model
for Option 1 and Option 2 and M/M/s for Option 3, the following results were
generated.
Outputs
Direct outputs from
inputs
Mean time between arrivals 0.033 0.033 0.033 hours
Mean time per service 0.021 0.017 0.021 hours
Traffic intensity 0.625 0.500 0.313
5
Summary measures
P(system empty) 0.375 0.500 0.524
P(all servers busy) 62.5% 50.0% 14.9%
Expected number in system 1.667 1.000 0.693 customers
Expected number in queue 1.042 0.500 0.068 customers
Expected time in system 0.056 0.033 0.023 hours
Expected time in queue 0.035 0.017 0.002 hours
Percentage who don't wait
in queue 37.5% 50.0% 85.1%
The table above shows that Option 3 yielded the minimal percentage of customers
who will not wait in the queue and at the same time has the lowest percentage of
server utilization. This means that Option 3, serves the greatest number of
customers and at the same time, does not fully utilize the capacity of the service
window. The spare time can be used on other direct or indirect cash generating
activities.
Based on the analysis of the options in the queue above, the following analysis were
derived to check the cost implications of the options:
From the table above, Option 1 yields the total overall costs factoring in server rates,
window fixed costs, and customer waiting value, while Option 3 yields the highest
cost. However, if we just want to factor in the possible costs in incurred due to in
efficient operations in the queue, Option 1 yields the highest customer waiting value
of Php 625.00 at any given hour. This is driven by the total customer waiting time.
6
At a level of two service windows, this provides the most efficient method of servicing
the customers waiting in the queue, because there is only a very small window of
waiting for the customers. However, in terms of the cost, this option will entail the
most costs since there is a need to provide salaries and wages to two employees
and allocate overhead costs for the two windows. But the cost of waiting will be
lessened by a lot with the value at a level of Php 46.50 only at any given hour.
Since the employees are also being paid at an hourly basis, it would also be good to
look at the utilization of the servers at the different options. At the point where all
servers are busy, Option 3 has the least busy time for the servers. Given that option
3 also has the highest costs at Php 2,246.50 comparing the three options, this may
be too expensive for Gordo given the idle or non-busy time of the servers. Option 1
also provides the most utilization and busy for the servers, albeit with a higher
waiting time and costs for the customers as discussed above.
REFERENCES
Taylor III, B. W. (2013). Introduction to Management Science. New Jersey: Pearson Education
Inc.