Scribd
Upload
33 views

Chapter 2

Uploaded by

Areeba Ashraf
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
33 views

Chapter 2

Uploaded by

Areeba Ashraf
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 21

Chapter 2

Simulation Examples
Simulation steps using Simulation Table

1. Determine the characteristics of each of the inputs to the


simulation (probability distributions).

2. Construct a simulation table (repetition 1).

3. For each repetition i, generate a value for the inputs, and


evaluate function, calculating a value of response yi.
Simulation of Queuing System (Details in chapter 6)

Simple single server queuing system


• Single server queue
• has three components calling population, waiting line,server
• Calling population is infinite-Arrival rate does not change
• Units are served according FIFO
• Arrivals are defined by the distribution of the time between arrivals -
inter-arrival time
• The arrival is the number of arrivals per unit of time.
• The inter arrival time is the time between each arrival into the system and the next.
• Service times are according to distribution
• Arrival rate must be less than service rate- stable system

Due to single server and single queue it is called single


server or single channel
• Queueing system state

– System
• Server
• Units (in queue or being served)
• Clock
– State of the system
• Number of units in the system
• Status of server (idle, busy)

– Events
• Arrival of a unit
• Departure of a unit
• Arrival Event
• If server idle customer gets service, otherwise customer
enters queue.

Unit actions upon arrival


Departure Event
If queue is not empty begin servicing next unit, otherwise
server will be idle.

It is impossible for the server


to become busy if the queue
is empty when a service is
completed

- Similarly it is impossible for


the server to be idle after the
service if the queue is not
empty

Server Outcomes after departure


Grocery Store Example(Ex 2.1)
• Producing Random Numbers from Random Digits

• Select randomly a number, e.g. 99219


- One digit: 0.9
- Two digits: 0.19
-Three digits: 0.219

• Proceed in a systematic direction,


e.g.
- first down then right
- first up then left
• Example1: A Grocery Store
• Average waiting time

• Probability that a customer has to wait

• Proportion of server idle time

• Average service time


• Average time between arrivals

• Average waiting time of those who wait

• Average time a customer spends in system


• Example 2: Call Center Problem
• Consider a Call Center where technical personnel take calls
and provide service
• Two technical support people (2 server) exists
– Able – more experienced, provides service faster
– Baker – newbie, provides service slower
• Rule
– Able gets call if both people are idle
• Find out how well the current arrangement works
Rnd digits for service :
26,98,90,26,46

Service time rnd digits:


95,21,51,92,38
Example 3: Inventory System
• Important class of simulation problems: inventory systems

• A simple inventory system with


 Lead time=0
 order quantities are probabilistic
 Demand is uniform over the time period

• Parameters
– N Review period length
– M Standard inventory level
– Qi Quantity of order i
• To avoid shortages, a buffer stock is needed
• Cost of stock
 Interest on funds
 Storage space
 Guards

• Alternative: To make more frequent reviews


 Ordering cost
 Cost in being short

• Performance measure: Total cost (or total profit)

• Events in an (M, N) inventory system are


– Demand for items
– Review of the inventory position
– Receipt of an order at the end of each review
Example 2.3
Newspaper sellers Problem

You might also like