Other Markovian Systems

Slides:



Advertisements
Similar presentations
Module C8 Queuing Economic/Cost Models. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some.
Advertisements

Chapter 9 Queuing Models.
Queuing Models.
QUEUING MODELS Based on slides for Hilier, Hiller, and Lieberman, Introduction to Management Science, Irwin McGraw-Hill.
Queuing Models M/M/k Systems. CLASSIFICATION OF QUEUING SYSTEMS Recall that queues are classified by (Arrival Dist.)/(Service Dist.)/(# servers) Designations.
Queuing Models Basic Concepts
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
Waiting Lines and Queuing Theory Models
Queueing Theory (2). Home Work 12-9 and Due Day: October 31 (Monday) 2005.
Queuing Models Economic Analyses. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some service.
Simulation A Queuing Simulation. Example The arrival pattern to a bank is not Poisson There are three clerks with different service rates A customer must.
Queuing Systems Chapter 17.
Multiple server queues In particular, we look at M/M/k Need to find steady state probabilities.
Waiting Line Models And Service Improvement
Chapter 13 Queuing Theory
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
Waiting Line Management
1 Overview of Queueing Systems Michalis Faloutsos Archana Yordanos The web.
MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide.
Module C10 Simulation of Inventory/Queuing Models.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
Waiting line Models.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
QUEUING MODELS Queuing theory is the analysis of waiting lines It can be used to: –Determine the # checkout stands to have open at a store –Determine the.
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.
Chapter 9: Queuing Models
Lecture 14 – Queuing Systems

Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
Spreadsheet Modeling & Decision Analysis
Queuing Theory Summary of results. 2 Notations Typical performance characteristics of queuing models are: L : Ave. number of customers in the system L.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Chapter 9 Queuing Models.
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.
Machine interference problem: introduction
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
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.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
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.
Introduction Definition M/M queues M/M/1 M/M/S M/M/infinity M/M/S/K.
Example 14.3 Queuing | 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n County Bank has several.
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.
Managerial Decision Making Chapter 13 Queuing Models.
Queuing Theory. Model Customers arrive randomly in accordance with some arrival time distribution. One server services customers in order of arrival.
Queuing Models Part 1: Basics
WAITING LINES AND SIMULATION
18 Management of Waiting Lines
Queuing Models Economic Analyses.
Queuing Theory Non-Markov Systems
Chapter 9: Queuing Models
Birth-Death Process Birth – arrival of a customer to the system
Solutions Queueing Theory 1
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
Solutions Queueing Theory 1
Queuing Theory By: Brian Murphy.
Mitchell Jareo MAT4340 – Operations Research Dr. Bauldry
Solutions Queueing Theory 1
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
Queuing Theory III.
Queuing Theory III.
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.
Queuing Models J. Mercy Arokia Rani Assistant Professor
Presentation transcript:

Other Markovian Systems Queuing Models Other Markovian Systems

MARKOVIAN SYSTEMS At least one of the arrival pattern or service time distribution is a Poisson process. There are many in which some of the conditions for M/M/k systems do not hold.

M/G/1 Systems M = Customers arrive according to a Poisson process at an average rate of  / hr. G = Service times have a general distribution with an average service time = 1/ hours and standard deviation of  hours (1/ and  in same units) 1 = one server Cannot get formulas for pn but can get performance measures using formulas.

Example -- Ted’s TV Repair Customers arrive according to a Poisson process once every 2.5 hours Repair times average 2.25 hours with a standard deviation of 45 minutes Ted is the only repairman: k= 1 THIS IS AN M/G/1 SYSTEM with:  = 1/2.5 = .4/hr. 1/ = 2.25 hours, so μ = 1/2.25 = .4444/hr.  = 45/60 = .75 hrs.

There are no formulas for the pn’s! Performance Measures The following are the hand calculations: P0 = 1-/ = 1-(.4/.4444) = .0991 L = (()2 + (/ )2)/(2(1-/ )) + / = ((.4)(.75)2 + (.4/.4444)2)/(2(.0991)) + (.4/.4444) = 5.405 LQ = L - / = 5.405 - .901 = 4.504 W = L/  = 5.405/.4 = 13.512 hrs. WQ = Lq/  = 4.504/.4 = 11.262 hrs. There are no formulas for the pn’s!

Input  (in customers/hr.)  (in customers/hr.)  (in hours) Performance Measures Select MG1 Worksheet

M/M/1 QUEUES WITH FINITE CALLING POPULATIONS (M/M/1//m) Maximum m school buses at repair facility, or m assigned customers to a salesman, etc. Both the arrival and service process are Poisson 1/ = average time between repeat visits for each of the m customers  = average number of arrivals of each customer per time period (day, week, mo. etc.) 1/ = average service time  = average service rate in same time units as 

Example -- Pacesetter Homes 4 projects Average 1 work stoppage every 20 days/project (Poisson Process) Average 2 days to resolve work stoppage dispute (Exponential Distribution) This is an M/M/1//m system with: m = 4 “arrival” rate of work stoppages,  = 1/20 = .05/day “service” rate,  = 1/2 = .5/day

Input , , m Performance Measures pn’s Select MM1 m Worksheet

Review An M/G/1 model is a single server model where the service time cannot be modeled as exponential, but has a mean time of 1/μ and standard deviation of service time, σ. Formulas exist for the steady state quantities for an M/G/1 system, but not for its, pn’s. An M/M/1//m is a single server system with a finite calling population of size m. Use of Templates MG1 MM1 m