SIMULATION EXAMPLES QUEUEING SYSTEMS.

Slides:

Advertisements

Similar presentations

Chapter Queueing Notation

Advertisements

Queueing Models and Ergodicity. 2 Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing models.

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

Queueing Theory: Recap

Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.

Waiting Lines and Queuing Theory Models

Queuing Systems Chapter 17.

EMGT 501 Fall 2005 Midterm Exam SOLUTIONS.

Components and Organization of Discrete-event Simulation Model

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

Waiting Line Management

Queueing Theory Chapter 17.

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

1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.

Simulating Single server queuing models. Consider the following sequence of activities that each customer undergoes: 1.Customer arrives 2.Customer waits.

Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO

Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO

Chapter 18 Management of Waiting Lines

Lab 01 Fundamentals SE 405 Discrete Event Simulation

Graduate Program in Engineering and Technology Management

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

Introduction to Management Science

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

Introduction to Queuing Theory

McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.

ETM 607 – Discrete Event Simulation Fundamentals Define Discrete Event Simulation. Define concepts (entities, attributes, event list, etc…) Define “world-view”,

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.

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.

Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.

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

1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.

Chapter 2 – Fundamental Simulation ConceptsSlide 1 of 46 Chapter 2 Fundamental Simulation Concepts.

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

CS352 - Introduction to Queuing Theory Rutgers University.

Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.

(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.

Waiting Line Theory Akhid Yulianto, SE, MSc (log).

1 1 Slide Chapter 12 Waiting Line Models n The Structure of a Waiting Line System n Queuing Systems n Queuing System Input Characteristics n Queuing System.

SIMULATION EXAMPLES. Monte-Carlo (Static) Simulation Estimating profit on a sale promotion Estimating profit on a sale promotion Estimating profit on.

Queuing Models.

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.

Discrete-Event System Simulation in Java. Discrete Event Systems New dynamic systems New dynamic systems Computer and communication networks Computer.

Queuing Theory Simulation & Modeling.

Topic V. Multiple-Channel Queuing Model

Modeling and Simulation

Chapter 1 What is Simulation?. Fall 2001 IMSE643 Industrial Simulation What’s Simulation? Simulation – A broad collection of methods and applications.

Module D Waiting Line Models.

McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.

WAITING LINES AND SIMULATION

“QUEUING THEORY”.

McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved

Queueing Theory What is a queue? Examples of queues:

Discrete Event Simulation

Chapter 9: Queuing Models

SIMULATION EXAMPLES QUEUEING SYSTEMS.

System Performance: Queuing

SIMULATION EXAMPLES QUEUEING SYSTEMS.

Variability 8/24/04 Paul A. Jensen

Queuing Theory By: Brian Murphy.

Mitchell Jareo MAT4340 – Operations Research Dr. Bauldry

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

Fundamental Simulation Concepts

Queueing Theory 2008.

MECH 3550 : Simulation & Visualization

Waiting Line Models Waiting takes place in virtually every productive process or service. Since the time spent by people and things waiting in line is.

SIMULATION EXAMPLES QUEUEING SYSTEMS.

Presentation transcript:

SIMULATION EXAMPLES QUEUEING SYSTEMS

Queueing Systems …… Entities Population Server Waiting Line (Queue) Finite vs. Infinite One server vs. multiple server One line vs. Multiple lines

Characteristics Interarrival and Service Times Queue discipline 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 Lindley’s Formula 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 Flowchart Schedule next arrival Increase number in the system L(t)=L(t)+1 Is server busy? NO YES Make server busy Increase entity number in queue B(t)=1 Q(t)=Q(t)+1 Set service time & schedule departure

Departure Event Flowchart Decrease number in system L(t)=L(t)-1 NO Is queue empty? YES Decrease number in queue Make server idle Q(t)=Q(t)-1 B(t)=0 Set service time & scheduled departure for entity in service

Simulation by Hand Run simulation for 20 minutes to find Average Waiting Time Average Queue Length Average Utilization Assume the first arrival occurs at zero

t = 0.00, Initialize

t = 0.00, Arrival of Part 1 1

t = 1.73, Arrival of Part 2 2 1

t = 2.90, Departure of Part 1 2

t = 3.08, Arrival of Part 3 3 2

t = 3.79, Arrival of Part 4 4 3 2

t = 4.41, Arrival of Part 5 5 4 3 2

t = 4.66, Departure of Part 2 5 4 3

t = 8.05, Departure of Part 3 5 4

t = 12.57, Departure of Part 4 5

t = 17.03, Departure of Part 5

t = 18.69, Arrival of Part 6 6

t = 19.39, Arrival of Part 7 7 6

t = 20.00, The End 7 6

Finishing Up Average waiting time in queue: Time-average number in queue: Utilization of drill press:

Complete Record of Hand Simulation