Chapter 3-

Simulation of Pure Pursuit problem:

Simulation of Queuing System,
Rudiments of Queuing Theory,
Simulation of Single Server,
Two Server and M-server Queuing
Systems,
Simulation in Inventory Control and
Forecasting
Objectives:
 Provide the learners the ability to visualize
and comprehend the concepts of queuing and
its relevance to simulation
 Compare and contrast single queue with
single queue multiple server and multiple
server
 Provide the learners the knowledge on the
importance of simulation in inventory
 Discuss the role of forecasting in simulation
method
What is discrete event
simulation
 Discrete event simulation (DES) is a
method of simulating the behavior and
performance of a real-life process, facility
or system.
DISCRETE–EVENT
SIMULATION OF QUEUING
SYSTEMS
The type of queuing system a business uses is an
important factor in determining how efficient the
business is run. Out of the many ways to attract
customers, an efficient queuing system plays an
important role as it reduces a customer’s waiting
time. The discrete–event simulation approach is used
to model the queuing systems and to analyze the side
effects when one system is changed to the other
Discrete Event Simulation ─ Key
Features
Discrete event simulation is generally carried
out by a software designed in high level
programming languages such as Pascal, C++,
or any specialized simulation language.
Following are the five key features −
Entities − These are the representation of
real elements.
Relationships − It means to link entities
together.
Discrete Event Simulation ─ Key
Features,,,continuation
 Simulation Executive − It is responsible for
controlling the advance time and executing
discrete events.
 Random Number Generator − It helps to
simulate different data coming into the
simulation model.
 Results & Statistics − It validates the model
and provides its performance measures.
Simulation of a Queuing
System
Rudiments of queuing theory
 Queuing Theory is the branch of
operations research concerned with waiting
lines
 Queuing theory utilizes mathematical
analysis to determine the systems measures
of effectiveness

A queuing network is a set of interconnected

queuing systems
Strength and Weaknesses
 Queuing models necessarily involve
approximations and simplification of reality
 Results give a sense of order of magnitude,
changes relative to a baseline, and promising
directions in which to move
 Some useful bounds for more general
systems at steady state
 Numerical solutions increasingly viable for
dynamic systems
Characteristics of Queuing
Systems
 The key elements of queuing systems are
customers and servers.
- The term customer can refer to people,
machines, trucks, airplanes etc. Anything
that arrive at a facility and requires service.
- The term server can refer to receptionist,
repair personnel, runways in airport,
washing machines etc. Any resource that
provides the requested service.
Elements

 The calling population

– The population of potential customers, referred to
as the calling population, may be assumed to be
finite or infinite.
 System capacity
– In many queueing systems there is a limit to the
number of customers that may be in the waiting
line or system. For example, an automatic car
wash may have room for only 10 cars to wait in
line to enter the mechanism.
Elements….continuation

 The arrival process

o how customers arrive e.g. singly or in groups
(batch or bulk arrivals)
o how the arrivals are distributed in time (e.g.
what is the probability distribution of time
between successive arrivals (the interarrival
time distribution))
Elements….continuation

 Queue Behavior and Queue Discipline

– Queue behavior refers to customer actions
while in a queue waiting for service to begin.
– Queue discipline refers to the logical ordering
of customers in a queue and determines which
customer will be chosen for service when a
server becomes free.
Queue Behavior
Customers may:
balking (customers deciding not to join the
queue if it is too long)
reneging (customers leave the queue if they
have waited too long for service)
jockeying (customers switch between queues if
they think they will get served faster by so
doing)
There are several different queueing
disciplines:
oFIFO (First-in, First-out):The jobs will be
served in the order of they arrive in the system.
oLIFO (Last-in,First-out): The jobs will be
served in the reverse order of they arrive in the
system.
oSIRO (Service In Random Order): The jobs will
be served in random order.
oPriority - Customers are served in order of their
importance on the basis of their service
requirements.
Elements….continuation

 Service Times and the Service Mechanism

– The service times of successive arrivals are
denoted by S1, S2, S3…They may be constant
or of random duration.
– Sometimes services may be identically
distributed for all customers of a given type or
class or priority, while customers of different
types may have completely different service-
time distributions.
General Queue
Figure 1 shows the model used to analyze a
general queue. The arrivals occur one at a time in
a random order and once the customer joins the
queuing system he will eventually receive the
service.
Single-Channel Queuing System
The single-channel queuing system has one single
queue diverge into a few counters. The moment a
customer leaves a service station, the customer at the
head of the queue will go to the server.
Multiple-Channels Queuing
System
It is a system whereby the customers line up
in rows directly in front of each server. They
are arranged in relatively straight lines that do
not converge.
Flexible queueing system
The flexible queueing system is a queueing
system with multiple classes of jobs and
heterogeneous servers where jobs have the
flexibility of being processed by more than
one server and server posses the capability of
processing more than one job class
A queueing system with full flexibility means
that in this system:
Each server has the capability of processing any
job class. It can be seen that server1 and server2
can handle the jobs from queue1 and queue2
The job can be processed by any server. The job
from queue1 and queue2 can be allocated to
server1 and server2.
In terms of the analysis of queuing situations
the types of questions in which we are
interested are typically concerned with
measures of system performance and might
include:
How long does a customer expect to wait in
the queue before they are served, and how
long will they have to wait before the service
is complete?
What is the probability of a customer having
to wait longer than a given time interval
before they are served?
 What is the average length of the queue?
 What is the probability that the queue will
exceed a certain length?
 What is the expected utilization of the server
and the expected time period during which he
will be fully occupied (remember servers cost
us money so we need to keep them busy). In
fact if we can assign costs to factors such as
customer waiting time and server idle time
then we can investigate how to design a
system at minimum total cost.
Problem Example
A grocery store has one check out counter.
The first customer arrives check out counter
at Time 0 and the interarrival time to 2 nd
customer is 8, then 3rd customer 6, 4th
customer 1, 5th customer 8, 6th customer 3.
Let say that the service time is 4, 1, 4, 3, 2, 4,
respectively. Analyze the system by
simulating the arrival and service of the six
(6) customer.
Where:
Average Waiting Time = Total Time Customer waits in queue
Number of customer

Probability that customer = Total # of customer who wait

has to wait in Queue Number of customer

Probability of Idle Time = Total Idle Time

Total run Time

Average Service Time = Total Service Time

Number of Customer
Where:
Average Time between= Sum of Time b/w arrivals
Arrival Number of arrivals - 1

Average waiting time of = Total waiting time

those who wait Number of customer who wait

Average time a customer = Total time spent in a system

Spend in the system Number of customer