Scribd
Upload
172 views

Multi Channel Queueing Able and Baker Example

The document describes a simulation of a drive-in restaurant with two carhops, Able and Baker, who take orders and deliver food to customers' cars over a 1-hour period. Cars arrive according to a given interarrival distribution and each carhop has their own service time distribution. The simulation tracks each customer's arrival time, service agent, service start and end times, and time spent waiting if the carhops are busy. The analysis finds that Able was busy 90% of the time while Baker was busy 69% of the time, 9 of 26 customers had to wait with an average wait time of 0.42 minutes, and the current system seems well balanced though adding a third carhop could reduce

Uploaded by

Kanwar Zain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
172 views

Multi Channel Queueing Able and Baker Example

The document describes a simulation of a drive-in restaurant with two carhops, Able and Baker, who take orders and deliver food to customers' cars over a 1-hour period. Cars arrive according to a given interarrival distribution and each carhop has their own service time distribution. The simulation tracks each customer's arrival time, service agent, service start and end times, and time spent waiting if the carhops are busy. The analysis finds that Able was busy 90% of the time while Baker was busy 69% of the time, 9 of 26 customers had to wait with an average wait time of 0.42 minutes, and the current system seems well balanced though adding a third carhop could reduce

Uploaded by

Kanwar Zain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Example: Multi-Channel Queue

The purpose of this example is to indicate the simulation procedure when there is more than one channel.
Consider a drive-in restaurant where carhops take orders & orders & bring food to the car. Cars arrive in
the manner shown in the table “Interarrival distribution of cars”. There are two carhops-Able & Baker.
Able is better able to do the job, & works somewhat faster than Baker. The distribution of service times is
shown in tables “Service distribution of Able” and “Service distribution of Baker”.
A simplifying rule is that Able gets customers if both carhops are idle.
The problem is to find how well the current arrangement is working. To estimate the system measures, a
simulation of 1-hour operation will be used. A longer simulation will be more reliable, but for purposes of
illustration 1-hour period has been selected.

INTERARRIVAL DISTRIBUTION OF CARS


Time Probability Cumulative Random
between Probability digit
Arrivals assignment
(minutes)
1 0.25 0.25 01 - 25
2 0.40 0.65 26 - 65
3 0.20 0.85 66 - 85
4 0.15 1.00 86 - 00
SERVICE DISTRIBUTION OF ABLE SERVICE DISTRIBUTION OF BAKER
Service Probability Cumulative Random Service Probability Cumulative Random digit
Time Probability digit Time Probability assignment
(minutes) assignment (minutes)

2 0.30 0.30 01 -30 3 0.35 0.35 01 -35


3 0.28 0.58 31 - 58 4 0.25 0.60 36 - 60
4 0.25 0.83 59 - 83 5 0.20 0.80 61 - 80
5 0.17 1.00 84 - 00 6 0.20 1.00 81 - 00
SIMULATION TABLE FOR CARHOP EXAMPLE
ABLE ABLE ABLE BAKER BAKER BAKER
Customer Random Time Clock time Random Time Service Time Time Service Time Time in
digits for between of Arrival digits for service time service service time service queue
arrival arrivals service begins (minutes) ends begins (minutes) ends (minutes)
1 - - 0 95 0 5 5 0
2 26 2 2 21 2 3 5 0
3 98 4 6 51 6 3 9 0
4 90 4 10 92 10 5 15 0
5 26 2 12 89 12 6 18 0
6 42 2 14 38 15 3 18 1
7 74 3 17 13 18 2 20 1
8 80 3 20 61 20 4 24 0
9 68 3 23 50 23 4 27 0
10 22 1 24 49 24 3 27 0
11 48 2 26 39 27 3 30 1
12 34 2 28 53 28 4 32 0
13 45 2 30 88 30 5 35 0
14 24 1 31 01 32 3 35 1
15 34 2 33 81 35 4 39 2
16 63 2 35 53 35 4 39 0
17 38 2 37 81 39 4 43 2
18 80 3 40 64 40 5 45 0
19 42 2 42 01 43 2 45 1
20 56 2 44 67 45 4 49 1
21 89 4 48 01 48 3 51 0
22 18 1 49 47 49 3 52 0
23 51 2 51 75 51 5 56 0
24 71 3 54 57 54 3 57 0
25 16 1 55 87 56 6 62 1
26 92 4 59 47 59 3 62 0
56 43 11
The analysis of “Simulation table for carhop example” results in the following:

1. Over the 62-minute period, Able was busy 90% of the time. (56/62*100)
2. Baker was busy only 69% of the time. The seniority rule keeps Baker less busy. (43/62*100)
3. 9 of the 26 arrivals (~35%) had to wait. The average waiting time for all customers was 0.42 minutes,
which is very small. (11/26)
4. Those 9, who did have to wait, only waited an average of 1.22 minutes, which is quite low.(11/9)
5. In summary the system seems well balanced. One server can not handle all the dinners, & 3 servers
would probably be too many. Adding an additional server would surely reduce the waiting time to nearly
zero. However, the cost of waiting would have to be quite high to justify an additional server.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy