Presentation is loading. Please wait.

Presentation is loading. Please wait.

Modeling and Simulation Dr. X. Topics  M/M/1 models and how they can be used  Simple Queuing Systems  Time-varying parameters  Simulation parameters.

Published byReginald Carter Modified over 9 years ago

Similar presentations

Presentation on theme: "Modeling and Simulation Dr. X. Topics  M/M/1 models and how they can be used  Simple Queuing Systems  Time-varying parameters  Simulation parameters."— Presentation transcript:

1 Modeling and Simulation Dr. X

2 Topics  M/M/1 models and how they can be used  Simple Queuing Systems  Time-varying parameters  Simulation parameters when measurements are not available  Appreciation of cost/benefit tradeoffs of a simulation

3 A hospital emergency department Three queuing systems Reneging Triage process Ambulance entrance

4 Single Server Queue with Reneging

5 Priority queue

6 Tandem queues

7 Tandem queues and ambulance arrivals

8 Arrival rate

9 Mean time to renege

10 Java Modeling Tools  http://jmt.sourceforge.net/ http://jmt.sourceforge.net/  Create three tandem queues with exponential arrival and departures, simulate to find the number of customers in each queue  How would you change Queue.java to simulate three queues in tandem?

11 References  The Guide to Computer Simulations and Games, Katrin Becker, J.R. Parker.

Download ppt "Modeling and Simulation Dr. X. Topics  M/M/1 models and how they can be used  Simple Queuing Systems  Time-varying parameters  Simulation parameters."

Similar presentations

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

IE 429, Parisay, January 2003 Review of Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete, continuous.
2 September, 2001J. Hagstrom, U. of Illinois1 Queuing Systems Jane Hagstrom.

2 September, 2001J. Hagstrom, U. of Illinois1 Queuing Systems Jane Hagstrom.
Queues and Priority Queues

Queues and Priority Queues
Queuing Analysis Based on noted from Appendix A of Stallings Operating System text 6/10/20151.

Queuing Analysis Based on noted from Appendix A of Stallings Operating System text 6/10/20151.
Chapter 22 Simulation with Process Model to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

Chapter 22 Simulation with Process Model to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.
Previously Optimization Probability Review Inventory Models Markov Decision Processes.

Previously Optimization Probability Review Inventory Models Markov Decision Processes.
Previously Optimization Probability Review Inventory Models Markov Decision Processes.

Previously Optimization Probability Review Inventory Models Markov Decision Processes.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.

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

Waiting Lines and Queuing Theory Models
Multiple server queues In particular, we look at M/M/k Need to find steady state probabilities.

Multiple server queues In particular, we look at M/M/k Need to find steady state probabilities.
Managing Waiting Lines

Managing Waiting Lines
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Simple queuing models (Sec. 8.2.1-8.2.2)

CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Simple queuing models (Sec )
Previously Optimization Probability Review Inventory Models Markov Decision Processes Queues.

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.

Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.
S. Mandayam/ CompArch2/ECE Dept./Rowan University Computer Architecture II: Specialized 0909.444.01/02 Fall 2001 John L. Schmalzel Shreekanth Mandayam.

S. Mandayam/ CompArch2/ECE Dept./Rowan University Computer Architecture II: Specialized /02 Fall 2001 John L. Schmalzel Shreekanth Mandayam.
1 Service A Queuing System Arrival Rate (  Average Number in Queue ( L q ) Avg Time in System ( W ) Avg Number in System ( L ) Average Wait in Queue.

1 Service A Queuing System Arrival Rate (  Average Number in Queue ( L q ) Avg Time in System ( W ) Avg Number in System ( L ) Average Wait in Queue.
Simulating Single server queuing models. Consider the following sequence of activities that each customer undergoes: 1.Customer arrives 2.Customer waits.

Simulating Single server queuing models. Consider the following sequence of activities that each customer undergoes: 1.Customer arrives 2.Customer waits.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.

Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO 80309-0419.

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 80309-0419.

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

Similar presentations

Ads by Google