100% found this document useful (1 vote)
124 views26 pages

Hand Simulation

The document discusses queueing systems and their analysis. It defines the key entities in a queueing system as the population of customers, servers, and queues. It describes different characteristics of queueing systems such as the interarrival and service time distributions, queueing disciplines like FIFO, and system capacity metrics. Examples of real-world queueing systems are provided. Methods for analyzing queueing systems include queueing theory, simulation, and performance measures like average waiting time. A spreadsheet example of an M/U/1 simulation and a hand simulation of a G/G/1 queue are presented to illustrate modeling queueing systems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
124 views26 pages

Hand Simulation

The document discusses queueing systems and their analysis. It defines the key entities in a queueing system as the population of customers, servers, and queues. It describes different characteristics of queueing systems such as the interarrival and service time distributions, queueing disciplines like FIFO, and system capacity metrics. Examples of real-world queueing systems are provided. Methods for analyzing queueing systems include queueing theory, simulation, and performance measures like average waiting time. A spreadsheet example of an M/U/1 simulation and a hand simulation of a G/G/1 queue are presented to illustrate modeling queueing systems.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 26

QUEUEING SYSTEMS

Queueing Systems
Entities

Population

Server

Waiting Line (Queue)

Finite vs.
Infinite

One line vs.


Multiple lines

One server vs.


multiple server

Characteristics
Interarrival and Service Times
Exponential (M)
Deterministic (D)
Erlang (E)
General (G)

Queue discipline

First Come/In First Served/Out (FCFS/FIFO)


Last Come/In First Served/Out (LCFS/LIFO)
Earliest Due Date (EDD)

System Capacity
Number of Servers

Applications
System

Entity

Server

Hospital

Patient

Doctor, Nurse

Manufacturing

Customer order

Machine

Food Store

Purchased grocery

Cashier

Bank

Client

Clerk

Computer

Job

CPU or disk

Communication Link

Data Package

Data Channel

Analysis Methods
Queueing Theory (Analytical)
Simulation
Performance Measures
Average Waiting Time
Maximum Waiting Time
Average Number of Entities in the System
Maximum Number of Entities in the System
Server Utilization
Average System Time
Maximum System Time

Spreadsheet Example
M/U/1 Simulation : Determine waiting time in

queue
Lindleys Formula

WQi max(WQi 1 Si 1 IAi ,0)

WQi : waiting time in queue for customer i


Si : service time for customer i
IAi : interarrival time between customers i-1
and i

Hand Simulation of G/G/1


Events:
Arrival Event entry of a unit into the system
Departure Event completion of service on a unit
End Event end of simulation

Variables:
Q(t) : number of units in queue at time t
B(t) : number of units in server at time t
L(t) = Q(t) + B(t) : number of units in system at

time t

Arrival event
Schedule next arrival
Increase number in the system

Make server busy

NO

B(t)=1

Is
server
busy?

YES

L(t)=L(t)+1

Increase entity number


in queue

Q(t)=Q(t)+1
Set service time &
schedule departure

Departure event

Decrease number in system

Decrease number in
queue

Q(t)=Q(t)-1
Set service time &
scheduled departure for
entity in service

NO

Is
queue
empty?

L(t)=L(t)-1

YES

Make server idle

B(t)=0

System

Clock

B(t)

Q(t)

Number of
completed waiting
times in queue

Total of
waiting times in queue

Arrival times of
custs. in queue

Area under
Q(t)

Event calendar

Area under
B(t)

Q(t) graph

3
2
1
0

B(t) graph

2
1
0

Run simulation for 20 minutes to find


Average Waiting Time
Average Queue Length
20
Average 10Utilization 15
Assume the first arrival occurs at zero
10

15

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

20

System

Number of
completed waiting
times in queue
0

Clock

B(t)

Q(t)

0.00

Arrival times of
Event calendar
custs. in queue
[1, 0.00,
Arr]
<empty> [, 20.00,
End]

Total of
waiting times in queue

Area under
Q(t)

Area under
B(t)

0.00

0.00

0.00

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

1
Number of
completed waiting
times in queue
1

Clock

B(t)

Q(t)

Total of
waiting times in queue

Arrival times of
Event calendar
custs. in queue
[2, 1.73,
Arr]
<empty> [1, 2.90,
Dep]
[, 20.00,
End]
Area under
Area under
Q(t)
B(t)

0.00

0.00

0.00

0.00

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

Number of
completed waiting
times in queue
1

Clock

B(t)

Q(t)

Total of
waiting times in queue

Arrival times of
Event calendar
custs. in queue
[1, 2.90,
Dep]
(1.73) [3, 3.08,
Arr]
[, 20.00,
End]
Area under
Area under
Q(t)
B(t)

1.73

0.00

0.00

1.73

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

2
Number of
completed waiting
times in queue
2

Clock

B(t)

Q(t)

Total of
waiting times in queue

Arrival times of
Event calendar
custs. in queue
[3, 3.08,
Arr]
<empty> [2, 4.66,
Dep]
[, 20.00,
End]
Area under
Area under
Q(t)
B(t)

2.90

1.17

1.17

2.90

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

Number of
completed waiting
times in queue
2

Clock

B(t)

Q(t)

Total of
waiting times in queue

Arrival times of
Event calendar
custs. in queue
[4, 3.79,
Arr]
(3.08) [2, 4.66,
Dep]
[, 20.00,
End]
Area under
Area under
Q(t)
B(t)

3.08

1.17

1.17

3.08

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

Number of
completed waiting
times in queue
2

Clock

B(t)

Q(t)

Total of
waiting times in queue

Arrival times of
Event calendar
custs. in queue
[5, 4.41,
Arr]
(3.79, 3.08) [2, 4.66,
Dep]
[, 20.00,
End]
Area under
Area under
Q(t)
B(t)

3.79

1.17

1.88

3.79

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

Number of
completed waiting
times in queue
2

Clock

B(t)

Q(t)

Total of
waiting times in queue

Arrival times of
Event calendar
custs. in queue
[2, 4.66,
Dep]
(4.41, 3.79, 3.08) [6, 18.69,
Arr]
[, 20.00,
End]
Area under
Area under
Q(t)
B(t)

4.41

1.17

3.12

4.41

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

Number of
completed waiting
times in queue
3

Clock

B(t)

Q(t)

Total of
waiting times in queue

Arrival times of
Event calendar
custs. in queue
[3, 8.05,
Dep]
(4.41, 3.79) [6, 18.69,
Arr]
[, 20.00,
End]
Area under
Area under
Q(t)
B(t)

4.66

2.75

3.87

4.66

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

Number of
completed waiting
times in queue
4

Clock

B(t)

Q(t)

Total of
waiting times in queue

Arrival times of
Event calendar
custs. in queue
[4, 12.57,
Dep]
(4.41) [6, 18.69,
Arr]
[, 20.00,
End]
Area under
Area under
Q(t)
B(t)

8.05

7.01

10.65

8.05

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

5
Number of
completed waiting
times in queue
5

Clock

B(t)

Q(t)

12.57

Arrival times of
custs. in queue

Total of
waiting times in queue

Area under
Q(t)

15.17

15.17

Event calendar
[5, 17.03,
Dep]
() [6, 18.69,
Arr]
[, 20.00,
End]
Area under
B(t)
12.57

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

Number of
completed waiting
times in queue
5

Clock

B(t)

Q(t)

17.03

Arrival times of
custs. in queue
()

Event calendar
[6, 18.69,
Arr]
[, 20.00,
End]

Total of
waiting times in queue

Area under
Q(t)

Area under
B(t)

15.17

15.17

17.03

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

6
Number of
completed waiting
times in queue
6

Clock

B(t)

Q(t)

18.69

Arrival times of
custs. in queue
()

Total of
waiting times in queue

Area under
Q(t)

Event calendar
[7, 19.39,
Arr]
[, 20.00,
End]
[6, 23.05,
Dep]
Area under
B(t)

15.17

15.17

17.03

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

Number of
completed waiting
times in queue
6

Clock

B(t)

Q(t)

Total of
waiting times in queue

Arrival times of
Event calendar
custs. in queue
[, 20.00,
End]
(19.39) [6, 23.05,
Dep]
[8, 34.91,
Arr]
Area under
Area under
Q(t)
B(t)

19.39

15.17

15.17

17.73

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

System

Number of
completed waiting
times in queue
6

Clock

B(t)

Q(t)

20.00

Arrival times of
Event calendar
custs. in queue
[6, 23.05,
Dep]
(19.39) [8, 34.91,
Arr]

Total of
waiting times in queue

Area under
Q(t)

Area under
B(t)

15.17

15.78

18.34

Q(t) graph

3
2
1
0

B(t) graph

10

15

20

10

15

20

2
1
0

Interarrival times

Time (Minutes)
1.73, 1.35, 0.71, 0.62, 14.28, 0.70, 15.52, 3.15, 1.76, 1.00, ...

Service times

2.90, 1.76, 3.39, 4.52, 4.46, 4.36, 2.07, 3.36, 2.37, 5.38, ...

Finishing Up

Average waiting time in queue:

Total of waiting times in queue 15.17

2.53 minutes per part


No. of waiting times in queue
6
Time-average number in queue:

Area under Q(t ) curve 15.78

0.79 part
Utilization
drill press:20
Final clockofvalue
Area under B(t ) curve 18.34

0.92 (dimension less)


Final clock value
20

You might also like