INSTRUCTOR: EL JIREH P.

BIBANGCO

Queuing Theory
Prepared by: El Jireh Bibangco
 INSTRUCTOR: EL JIREH P. BIBANGCO

Learning Objectives

In this chapter you will learn about:

 Basic queuing concept and systems;

 classification of queuing systems;
 random digit assignment; and
 single and mutiple queues.
 INSTRUCTOR: EL JIREH P. BIBANGCO

Queue: Defined!
 Queue – represents waiting line; insertions are
made at the back (tail) of a queue and deletions
are made at the front (head).
 Queuing System - a model using the principles of a
queue; it includes the server, the unit being served,
and units in the queue (waiting line).

SERVER POPULATION
WAITING LINE
 INSTRUCTOR: EL JIREH P. BIBANGCO

Terms
 State – number of units in the system and the
status of the server
 Event – set of circumstances that cause an
instantaneous chance in the state of the system
 Customer – anything that arrives at the facility and
required service
 Server – any resource which provides the
requested service.
 INSTRUCTOR: EL JIREH P. BIBANGCO

Basic Queuing Configuration

Departure after
Arrival Service

QUEUE

SERVICE
FACILITY
Single-Channel, Single-Phase System
 INSTRUCTOR: EL JIREH P. BIBANGCO

Basic Queuing Configuration

Departure after
Arrival Service

QUEUE

TYPE 1 TYPE 2
SERVICE SERVICE
FACILITY FACILITY

Single-Channel, Multi-Phase System

 INSTRUCTOR: EL JIREH P. BIBANGCO

Basic Queuing Configuration

Departure after
QUEUE Service
Arrival TYPE 1
SERVICE
FACILITY

TYPE 2
SERVICE
FACILITY

TYPE 3
Multi-Channel, SERVICE
FACILITY
Single-Phase System
 INSTRUCTOR: EL JIREH P. BIBANGCO

Basic Queuing Configuration

Departure after
QUEUE Service
Arrival
TYPE 1 TYPE 2
SERVICE SERVICE
FACILITY 1 FACILITY 1

TYPE 1 TYPE 2
SERVICE SERVICE
Multi-Channel, FACILITY 2 FACILITY 2

Multi-Phase System
 INSTRUCTOR: EL JIREH P. BIBANGCO

Characteristics
 Calling Population – the population of potential
customers; may be assumed to be finite or infinite.
 Nature of Arrivals – one at a time in random;
 Service Mechanism – functionality; operation
 System Capacity – limited or unlimited
 Queuing Discipline – FIFO or priority scheduling
 INSTRUCTOR: EL JIREH P. BIBANGCO

Steps in Queue Simulation

 Determine input characteristics

 Construct a simulation table

 Perform a repetitive process generating a value for

each input, evaluate the function and calculate the
value of the response.
 INSTRUCTOR: EL JIREH P. BIBANGCO

Unit-entering-system
Arrival Event

No Yes
Unit Enters Queue
Unit Enters Service Server Busy? for Service
 INSTRUCTOR: EL JIREH P. BIBANGCO

Service-just-completed
Departure Event

No Yes
Begin Server Another Unit Remove the Waiting
Idle Time Waiting? Unit from Queue

Begin Servicing
the Unit
 INSTRUCTOR: EL JIREH P. BIBANGCO

Potential unit action upon arrival

Queue Status
Not Empty Empty
Server Busy Enter Queue Enter Queue
Status
Idle Impossible Enter service
 INSTRUCTOR: EL JIREH P. BIBANGCO

Service outcomes after service

Queue Status
Not Empty Empty
Server Busy Enter Queue Impossible
Outcomes
Idle Impossible Enter service
 INSTRUCTOR: EL JIREH P. BIBANGCO

Elements of time …
INTERARRIVAL & CLOCK TIME SERVICE TIME

C IT AT C ST
1 - 0 1 2
2 2 2 2 1
3 4 6 3 3
4 1 7 4 2
5 2 9 5 1
6 6 15 6 4
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation table with clock time

A B C D E
C# Arrival Time TS Begins Service TS Ends
Time
1 0 0 2 2
2 2 2 1 3
3 6 6 3 9
4 7 9 2 11
5 9 11 1 12
6 15 15 4 19
 INSTRUCTOR: EL JIREH P. BIBANGCO

Number of customers & clocktime

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
 INSTRUCTOR: EL JIREH P. BIBANGCO

An issue of random digit assignment

 A set of uniformly distributed random numbers is
needed to generate the arrival.
 Random number properties :
 The set of random numbers is uniformly distributed
between 0 and 1.
 Successive random numbers are independent.
 INSTRUCTOR: EL JIREH P. BIBANGCO

Case #1 : Single Queue

 A store has only one checkout counter. Customers
arrive at this checkout counter at random from 1 to
8 minutes apart. Each possible value of interarrival
time has the same probability of occurrence.
 Compute for the cumulative probability and range
of random-digit assignment.
 INSTRUCTOR: EL JIREH P. BIBANGCO

Case #1 (continued)
 Complete the time TA Prob Prob RDA
between arrivals 1 0.125 0.125 001 - 125
table, the cumulative
probability and 2 0.125 0.250 126 - 250

random digit 3 0.125 0.375 251 - 375

assignment.
4 0.125 0.500
376 - 500

5 0.125 0.625 501 - 625

6 0.125 0.750
626 - 750

7 0.125 0.875 751 - 875

8 0.125 1.000 876 - 000

 INSTRUCTOR: EL JIREH P. BIBANGCO

Case #1 (continued)
 Complete the service ST Prob Prob RDA
time table by 1 0.10 0.10 01 – 10
computing the
cumulative 2 0.20 0.30 11 - 30

probability and 3 0.30 0.60 31 - 60

random digit 4 0.25 0.85 61 - 85
assignment.
5 0.10 0.95 86 - 95

6 0.05 1.00 96 - 00
 INSTRUCTOR: EL JIREH P. BIBANGCO

Sample RDA …
INTERARRIVAL & CLOCK TIME SERVICE TIME

C RDA IT C RDA ST
1 - - 1 84 4
2 913 8 2 10 1
3 727 6 3 74 4
4 015 1 4 53 3
… … … … … …
n 999 t n 99 t
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 10 Customers

Customer RDA (IT) IT RDA (ST) ST
1 - - 84 4
2 913 8 10 1
3 727 6 74 4
4 015 1 53 3
5 948 8 17 2
6 309 3 79 4
7 922 8 91 5
8 753 7 67 4
9 235 2 89 5
10 302 3 38 3
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 10 Customers

C IT AT ST TSB WT TSE TSS IT
1 - 4
2 8 1
3 6 4
4 1 3
5 8 2
6 3 4
7 8 5
8 7 4
9 2 5
20 3 3
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 10 Customers

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4
2 8 8 1
3 6 14 4
4 1 15 3
5 8 23 2
6 3 26 4
7 8 34 5
8 7 41 4
9 2 43 5
10 3 46 3
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 10 Customers

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0
2 8 8 1 8
3 6 14 4 14
4 1 15 3 18
5 8 23 2 23
6 3 26 4 26
7 8 34 5 34
8 7 41 4 41
9 2 43 5 45
10 3 46 3 50
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 10 Customers

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0 4
2 8 8 1 8 9
3 6 14 4 14 18
4 1 15 3 18 21
5 8 23 2 23 25
6 3 26 4 26 30
7 8 34 5 34 39
8 7 41 4 41 45
9 2 43 5 45 50
20 3 46 3 50 53
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 10 Customers

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0 0 4
2 8 8 1 8 0 9
3 6 14 4 14 0 18
4 1 15 3 18 3 21
5 8 23 2 23 0 25
6 3 26 4 26 0 30
7 8 34 5 34 0 39
8 7 41 4 41 0 45
9 2 43 5 45 2 50
20 3 46 3 50 4 53
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 10 Customers

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0 0 4 4
2 8 8 1 8 0 9 1
3 6 14 4 14 0 18 4
4 1 15 3 18 3 21 6
5 8 23 2 23 0 25 2
6 3 26 4 26 0 30 4
7 8 34 5 34 0 39 5
8 7 41 4 41 0 45 4
9 2 43 5 45 2 50 7
20 3 46 3 50 4 53 7
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 10 Customers

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0 0 4 4 0
2 8 8 1 8 0 9 1 4
3 6 14 4 14 0 18 4 5
4 1 15 3 18 3 21 6 0
5 8 23 2 23 0 25 2 2
6 3 26 4 26 0 30 4 1
7 8 34 5 34 0 39 5 4
8 7 41 4 41 0 45 4 2
9 2 43 5 45 2 50 7 0
20 3 46 3 50 4 53 7 0
 INSTRUCTOR: EL JIREH P. BIBANGCO

Average Waiting Time

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0 0 4 4 0 AWT = ΣWT/ΣC
2 8 8 1 8 0 9 1 4
3 6 14 4 14 0 18 4 5 Given: ΣWT = 9
4 1 15 3 18 3 21 6 0 ΣC = 10
5 8 23 2 23 0 25 2 2
6 3 26 4 26 0 30 4 1 AWT = ΣWT/ΣC
7 8 34 5 34 0 39 5 4 = 9/10
8 7 41 4 41 0 45 4 2 = 0.9 minutes
9 2 43 5 45 2 50 7 0
10 3 46 3 50 4 53 7 0
 INSTRUCTOR: EL JIREH P. BIBANGCO

Probability (Wait)
C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0 0 4 4 0 P(W) = ΣC(W)/ΣC
2 8 8 1 8 0 9 1 4
3 6 14 4 14 0 18 4 5 Given: ΣC(W) = 3
4 1 15 3 18 3 21 6 0 ΣC = 10
5 8 23 2 23 0 25 2 2
6 3 26 4 26 0 30 4 1 P(W) = ΣC(W)/ΣC
7 8 34 5 34 0 39 5 4 = 3/10
8 7 41 4 41 0 45 4 2 = 0.3 or 30%
9 2 43 5 45 2 50 7 0
10 3 46 3 50 4 53 7 0
 INSTRUCTOR: EL JIREH P. BIBANGCO

Probability (Idle Server)

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0 0 4 4 0 P(IS) = ΣIT/ΣRT
2 8 8 1 8 0 9 1 4
3 6 14 4 14 0 18 4 5 Given: ΣIT = 18
4 1 15 3 18 3 21 6 0 ΣRT= 53
5 8 23 2 23 0 25 2 2
6 3 26 4 26 0 30 4 1 P(IS) = ΣIT/ΣRT
7 8 34 5 34 0 39 5 4 = 18/53
8 7 41 4 41 0 45 4 2 = 0.34 or 34%
9 2 43 5 45 2 50 7 0
10 3 46 3 50 4 53 7 0
 INSTRUCTOR: EL JIREH P. BIBANGCO

Average Service Time

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0 0 4 4 0 AST = ΣST/ΣC
2 8 8 1 8 0 9 1 4
3 6 14 4 14 0 18 4 5 Given: ΣST = 35
4 1 15 3 18 3 21 6 0 ΣC= 10
5 8 23 2 23 0 25 2 2
6 3 26 4 26 0 30 4 1 AST = ΣST/ΣC
7 8 34 5 34 0 39 5 4 = 35/10
8 7 41 4 41 0 45 4 2 = 3.5 minutes
9 2 43 5 45 2 50 7 0
10 3 46 3 50 4 53 7 0
 INSTRUCTOR: EL JIREH P. BIBANGCO

Average Waiting Time (Wait)

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0 0 4 4 0 AWT(W) = ΣWT/ΣC(W)
2 8 8 1 8 0 9 1 4
3 6 14 4 14 0 18 4 5 Given: ΣWT = 9
4 1 15 3 18 3 21 6 0 ΣC(W)= 3
5 8 23 2 23 0 25 2 2
6 3 26 4 26 0 30 4 1 AWT(W)= ΣWT/ΣC(W)
7 8 34 5 34 0 39 5 4 = 9/3
8 7 41 4 41 0 45 4 2 = 3 minutes
9 2 43 5 45 2 50 7 0
10 3 46 3 50 4 53 7 0
 INSTRUCTOR: EL JIREH P. BIBANGCO

Average Time Spent on System

C TBA AT ST TSB WT TSE TSS IT
1 - 0 4 0 0 4 4 0 ATSS= ΣTSS/ΣC
2 8 8 1 8 0 9 1 4
3 6 14 4 14 0 18 4 5 Given: ΣTSS = 44
4 1 15 3 18 3 21 6 0 ΣC= 10
5 8 23 2 23 0 25 2 2
6 3 26 4 26 0 30 4 1 ATSS= ΣTSS/ΣC
7 8 34 5 34 0 39 5 4 = 44/10
8 7 41 4 41 0 45 4 2 = 4.4 minutes
9 2 43 5 45 2 50 7 0
10 3 46 3 50 4 53 7 0
 INSTRUCTOR: EL JIREH P. BIBANGCO

Case #2 : Double Queue

 Consider a drive-in restaurant where carhops take
orders and bring food to the car. Cars arrive in the
manner shown on the succeeding table. There are
two carhops – Able and Baker. Able is better able
to do the job and works a faster than Baker. The
distribution of their service times are also shown
on the succeeding table. (to simplify the rule, Able
gets the customer if both carhops are idle.)
 Compute for the cumulative probability and range
of random-digit assignment.
 INSTRUCTOR: EL JIREH P. BIBANGCO

Case #2 (continued)
 Complete the TA Prob Prob RDA
time between
arrival table by 1 0.25 0.25 01 – 25

computing the 2 0.40 0.65 26 - 65

cumulative
3 0.20 0.85 66 - 85
probability and
random digit 4 0.15 1.00 86 - 00
assignment.
 INSTRUCTOR: EL JIREH P. BIBANGCO

Case #2 (continued)
 Service ST Prob Prob RDA
Distribution
2 0.30 0.30 01 – 30
of Able
3 0.28 0.58 31 - 58

4 0.25 0.83 59 - 83

5 0.17 1.00 84 - 00
 INSTRUCTOR: EL JIREH P. BIBANGCO

Case #2 (continued)
 Service ST Prob Prob RDA
Distribution
3 0.35 0.35 01 – 35
of Baker
4 0.25 0.60 36 - 60

5 0.20 0.80 61 - 80

6 0.20 1.00 81 - 00
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 5 Customers

ABLE BAKER

C RDA TBA AT RDA TSB ST TSE TSB ST TSE WT

(TBA) (ST)
1 - 95

2 26 21

3 98 51

4 90 92

5 26 89
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 5 Customers

ABLE BAKER

C RDA TBA AT RDA TSB ST TSE TSB ST TSE WT

(TBA) (ST)
1 - - 95

2 26 2 21

3 98 4 51

4 90 4 92

5 26 2 89
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 5 Customers

ABLE BAKER

C RDA TBA AT RDA TSB ST TSE TSB ST TSE WT

(TBA) (ST)
1 - - 0 95

2 26 2 2 21

3 98 4 6 51

4 90 4 10 92

5 26 2 12 89
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 5 Customers

ABLE BAKER

C RDA TBA AT RDA TSB ST TSE TSB ST TSE WT

(TBA) (ST)
1 - - 0 95 0 5 5 0

2 26 2 2 21

3 98 4 6 51

4 90 4 10 92

5 26 2 12 89
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 5 Customers

ABLE BAKER

C RDA TBA AT RDA TSB ST TSE TSB ST TSE WT

(TBA) (ST)
1 - - 0 95 0 5 5 0

2 26 2 2 21 2 3 5 0

3 98 4 6 51

4 90 4 10 92

5 26 2 12 89
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 5 Customers

ABLE BAKER

C RDA TBA AT RDA TSB ST TSE TSB ST TSE WT

(TBA) (ST)
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

5 26 2 12 89
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 5 Customers

ABLE BAKER

C RDA TBA AT RDA TSB ST TSE TSB ST TSE WT

(TBA) (ST)
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
 INSTRUCTOR: EL JIREH P. BIBANGCO

Simulation with 5 Customers

ABLE BAKER

C RDA TBA AT RDA TSB ST TSE TSB ST TSE WT

(TBA) (ST)
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
 INSTRUCTOR: EL JIREH P. BIBANGCO

D’TOUR >>
ABLE BAKER
C RDA TBA AT RDA TSB ST TSE TSB ST TSE WT
(TBA) (ST)
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
 INSTRUCTOR: EL JIREH P. BIBANGCO

END
Thank You