Homework 5. Homework 2: Post Office Simulator Implementing a discrete event simulator to evaluate the performance of a post office Basic Requirement (75%):

Slides:

Advertisements

Similar presentations

IE 429, Parisay, January 2003 Review of Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete, continuous.

Advertisements

 1  Outline  performance measures for a single-server station  discrete-event simulation  hand simulation  process-oriented simulation approach.

Q vs Await Node Q is a simplified Await node Q activity is the resource ie server, inspection Await Node can specify resource that is needed by activity.

Previously Optimization Probability Review Inventory Models Markov Decision Processes.

Chap. 20, page 1051 Queuing Theory Arrival process Service process Queue Discipline Method to join queue IE 417, Chap 20, Jan 99.

Previously Optimization Probability Review Inventory Models Markov Decision Processes Queues.

Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.

1 Queuing Theory 2 Queuing theory is the study of waiting in lines or queues. Server Pool of potential customers Rear of queue Front of queue Line (or.

Lecture 11 Queueing Models. 2 Queueing System  Queueing System:  A system in which items (or customers) arrive at a station, wait in a line (or queue),

Data Communication and Networks Lecture 13 Performance December 9, 2004 Joseph Conron Computer Science Department New York University

Performance Evaluation

1 Overview of Queueing Systems Michalis Faloutsos Archana Yordanos The web.

Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.

7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.

The Poisson process and exponentially distributed service time In real life customers don’t arrive at pre-ordained times as specified in the last tutorial…

Queuing Theory. Queuing theory is the study of waiting in lines or queues. Server Pool of potential customers Rear of queue Front of queue Line (or queue)

Lecture 4 Mathematical and Statistical Models in Simulation.

Lab 01 Fundamentals SE 405 Discrete Event Simulation

Internet Queuing Delay Introduction How many packets in the queue? How long a packet takes to go through?

Limiting probabilities. The limiting probabilities P j exist if (a) all states of the Markov chain communicate (i.e., starting in state i, there is.

 1  Outline  simulating GI/G/1 queues  M/M/1 queues  theoretical results of queueing systems  an inventory system  simulation program with an event.

Graduate Program in Engineering and Technology Management

Buffer or Suffer Principle

Simulate THAT! Jim Caristi Dept. of Math & Computer Science Valparaiso University.

___________________________________________________________________________ Operations Research  Jan Fábry Waiting Line Models.

(C) 2009 J. M. Garrido1 Object Oriented Simulation with Java.

Waiting Line Models ___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry.

CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.

Queueing Analysis of Production Systems (Factory Physics)

1 Queuing Analysis Overview What is queuing analysis? - to study how people behave in waiting in line so that we could provide a solution with minimizing.

Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.

Entities and Objects The major components in a model are entities, entity types are implemented as Java classes The active entities have a life of their.

Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.

1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Queuing Modeling and Analysis.

SIMULATION EXAMPLES QUEUEING SYSTEMS.

An Optimal Service Ordering for a World Wide Web Server A Presentation for the Fifth INFORMS Telecommunications Conference March 6, 2000 Amy Csizmar Dalal.

Simulation with ArenaChapter 2 – Fundamental Simulation ConceptsSlide 1 of 46 Simulation by Hand: Setup.

1 Part 2 & 3 Performance evaluation. 2 Goals Understand the complex behavior of systems subject to "random phenomena" Develop intuitive understanding.

Simulation Examples and General Principles

Discrete Event (time) Simulation. What is a simulation? “Simulation is the process of designing a model of a real system and conducting experiments with.

1 Simulation Implementation Using high-level languages.

1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Mean inter-arrival time = 1/Ri = 1/R  Probability that the time between two arrivals.

Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.

1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3 Example: The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.

Chapter 6 Queueing Models

Dr. Anis Koubâa CS433 Modeling and Simulation

(C) J. M. Garrido1 Objects in a Simulation Model There are several objects in a simulation model The activate objects are instances of the classes that.

EVOLUTION OF INDUSTRIAL ENGINEERING Prof. Dr. Orhan TORKUL Res. Asst. M. Raşit CESUR Res. Asst. Furkan YENER.

Queueing Theory. The study of queues – why they form, how they can be evaluated, and how they can be optimized. Building blocks – arrival process and.

Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.

Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.

QUEUING THEORY 1.  - means the number of arrivals per second   - service rate of a device  T - mean service time for each arrival   = ( ) Utilization,

Queuing Theory. Model Customers arrive randomly in accordance with some arrival time distribution. One server services customers in order of arrival.

WAITING LINES AND SIMULATION

18 Management of Waiting Lines

ETM 607 – Spreadsheet Simulations

Internet Queuing Delay Introduction

Demo on Queuing Concepts

Internet Queuing Delay Introduction

Introduction Notation Little’s Law aka Little’s Result

Queuing Theory By: Brian Murphy.

Mitchell Jareo MAT4340 – Operations Research Dr. Bauldry

Topic IV. Single Channel Systems (Limited queue length system)

Discrete Event “Hand” Simulation of a GI/GI/1 Queue

Queueing Theory 2008.

Kendall’s Notation ❚ Simple way of summarizing the characteristics of a queue. Arrival characteristics / Departure characteristics / Number of servers.

SIMULATION EXAMPLES QUEUEING SYSTEMS.

Presentation transcript:

Homework 5

Homework 2: Post Office Simulator Implementing a discrete event simulator to evaluate the performance of a post office Basic Requirement (75%): Two Servers and a Single Queue Bonus 1 (15%): Two Servers and Two Queues Bonus 2 (20%) Basic Requirement (General distribution) + Restroom Events Note: no other bonus!!

Basic Requirement: Two Servers and Single Queue Two servers have the same service rate FIFO queue Infinite queue capacity Inter-arrival and service time: i.i.d. and exponential distribution

input.txt Arrival rate (# of customers/time unit): float Service rate(# of customers/time unit): float Simulation time (time unit): int (Max: ) Basic Requirement: Two Servers and Single Queue

output.txt (free format) Average waiting time: T start_service - T arrival Average system time: T end_service - T arrival System utilization ratio: the probability that at least one staff is busy Full utilization ratio: the probability that both two staffs are busy Basic Requirement: Two Servers and Single Queue

Each server has a single queue The policy for queue selection: choosing the queue having fewer customers After entering a queue, a customer can not change his queue Other setups = “Basic Requirement” Bonus 1 (15%): Two Servers and Two Queues

Single queue Inter-arrival and service time: normal distribution (<0) A staff would go to the restroom Single restroom (service time: exponential distribution) Single queue for the restroom: a staff needs to line up while the washroom is busy Bonus 2 (20%): G/G/2 + restroom events

A staff can not go to the restroom while serving a customer Bonus 2 (20%): M/M/2 + restroom events time Staff Alice begins serving customer 08:23:10 Staff Alice finishes serving customer 08:33:42 Alice needs to go to the 08:28:36 Alice goes to the restroom

Inter-rest-time: T need_to_restroom (Staff) – T finish_restroom (Staff) Exponential Dis. Bonus 2 (20%): M/M/2 + restroom events time The restroom finishes serving staff T finish_restroom (Jane) Alice goes to the restroom and lines T go_to_restroom (Alice) Alice needs to go to the T need_to_restroom (Alice) Inter-rest-time for Alice The restroom begins serving staff T start_restroom (Alice) The restroom finishes serving staff T finish_restroom (Alice)

Bonus 2 (20%): M/M/2 + restroom events input.txt Inter-arrival time (time unit): float(mean) float(variance) Service time (time unit): float(mean) float(variance) Simulation time (time unit): int ( ) Inter-rest-time (time unit): float Service rate of the restroom (# of staffs/time unit): float Normal Dis. Exp. Dis.

Bonus 2 (20%): M/M/2 + restroom events output.txt (free format) Average waiting time: T start_service - T arrival Average system time: T end_service - T arrival System utilization ratio: the probability that at least one staff is busy Full utilization ratio: the probability that both two staffs are busy Average waiting time for restroom events: T start_restroom - T need_to_restroom

Notes Deadline: 2014/5/15 12:20 to: Subject: [Perf.] homework 5 submit Programming language: C/C++/Java Student ID_v1.rar (EX: r _v1.rar) Including: readme.txt and source codes readme.txt How to execute (compile) the code? OS platform: linux or win Don’t implement simulation with “time-slices approach” 0 pt !!!!