Delays Deterministic Stochastic Assumes “error free” type case

Slides:



Advertisements
Similar presentations
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
Advertisements

Chap. 20, page 1051 Queuing Theory Arrival process Service process Queue Discipline Method to join queue IE 417, Chap 20, Jan 99.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
Queuing Systems Chapter 17.
Multiple server queues In particular, we look at M/M/k Need to find steady state probabilities.
Queuing CEE 320 Anne Goodchild.
Lec13, Ch.6, pp : Gap acceptance and Queuing Theory (Objectives)
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
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),
1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
Internet Queuing Delay Introduction How many packets in the queue? How long a packet takes to go through?
Chapter 9: Queuing Models
Lecture 14 – Queuing Systems
Queuing Models and Capacity Planning
D-1 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Operations Management Waiting-Line Models Module D.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.
 Birth Death Processes  M/M/1 Queue  M/M/m Queue  M/M/m/B Queue with Finite Buffers  Results for other Queueing systems 2.
Introduction to Operations Research
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
TexPoint fonts used in EMF.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
Queuing Theory. Introduction Queuing is the study of waiting lines, or queues. The objective of queuing analysis is to design systems that enable organizations.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Queueing System Provide a mean to estimate important measures of Highway Performance Travel time Speed Affects Roadway Design Required left-turn bay length.
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...
Waiting Lines and Queuing Theory Models
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 CEE 8207 Summer 2013 L#6 Queue. 2 Queueing System Provide a mean to estimate important measures of Highway Performance  Travel time  Speed Affects.
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.
1 Queuing Delay and Queuing Analysis. RECALL: Delays in Packet Switched (e.g. IP) Networks End-to-end delay (simplified) = End-to-end delay (simplified)
Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
Queuing Models.
Managerial Decision Making Chapter 13 Queuing Models.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
WAITING LINES AND SIMULATION
Lecture 14 – Queuing Networks
Models of Traffic Flow 1.
Chapter 9: Queuing Models
Internet Queuing Delay Introduction
Demo on Queuing Concepts
Lecture on Markov Chain
Management of Waiting Lines
Internet Queuing Delay Introduction
Chapter 6 Queuing Models.
Our favorite simple stochastic process.
Delays Deterministic Stochastic Assumes “error free” type case
System Performance: Queuing
TexPoint fonts used in EMF.
Variability 8/24/04 Paul A. Jensen
Queuing Theory By: Brian Murphy.
Queuing Analysis Two analytical techniques can be employed to study queuing processes: Shock wave analysis Demand-capacity process is deterministic Suited.
Lecture 13 – Queuing Systems
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
Lecture 14 – Queuing Networks
Queueing Theory 2008.
Carey Williamson Department of Computer Science University of Calgary
CSE 550 Computer Network Design
Queuing Models J. Mercy Arokia Rani Assistant Professor
Queueing analysis Basics Methodologies Models Queueing process
Presentation transcript:

Delays Deterministic Stochastic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known) Stochastic Delay may occur any time Random arrivals and departures per stat function There is not too much content in the textbook about delay, ( basically the textbook mentions only one fundamental equation). However, problems at the end of the textbook require use of specific models, such as MM1, MD1, etc. Complimentary material has been added to this ppt to aid students in solving the homework problems.  Formula derivation: all the queuing equations for stochastic models are derived from one basic equation, which is in the text book. Thus as long as you know about what's the standard deviation and expected value, you can derive the queuing equations yourself, which is much less confusing I believe, and also helps people easily understand. There are no queuing equations in the chapter on delay in the textbook, so formula deviation could help with consistency. We may not have time to derive all the equation in class, but students can take a look at the equations to see what's going on.   

Deterministic Delay

Queuing Diagram (1/2) Greatest Delay Total delay time Delayed Aircraft Greatest Queue Runway Capacity Delay Period

Delay Estimation (2/2) Area Demand-Capacity A/C-Hours of delay D-C Time

Example (1/2) End hour Operations Capacity D-C Cumul. (Queue) 7 25 30 -5 8 9 40 10 50 20 11 45 15 12 -15 13 -20 14 -10 sum 250

Example (2/2) Area under the curve = ½*1*10+½*(10+30)*1+½*(30+40)*1+ +½*(40+30)*1 +½*(30+10)*1+½*10*1=120 AC-hr Avg Delay to All AC = 120/250 = 28.8 min/AC Avg Delay to Delayed = 120/(40+50+45+15+10+15) = 41.1 min/AC

Stochastic Delay Queuing theory concepts Required data Probability function Arrival rate Service time Required data Arrival pattern Service pattern Service method Queue discipline Number of servers

Delay Equations (random/poisson arrivals, uniform service dist means variance = 0) See p. 304 To use for HW prob 16, must compute average hourly demand (blows up if demand>supply) part c should more properly be worded “increased” to 8 minutes, not “limited” to 8 minutes.

Mathematical Formulation of Delay * Where W= mean delay to arriving (or departing) aircraft λ = mean arrival (or departure) rate of aircraft (number per hour) 𝜇 = mean service rate for arrivals (or departures), = reciprocal of mean service time (number per hour) 𝜎 = standard deviation of mean service time of arriving (or departing) aircraft (number per hour) Can be used in all stochastic delay models. *Note: the book uses λ and μ; some of these and other lecture’s notes use q and Q

M/D/1 Queuing Model M -- exponentially distributed times between arrivals of successive vehicles (Poisson arrivals) D -- Service times are fixed and constant (no variance: 𝜎=0 ) 1 – One runway “Traffic intensity” term is used to define the ratio of average arrival to departure rates:

M/D/1 Queuing Model q -- Arrival (or departure) rate = λ Q -- Service rate (utilization) = 𝜇 Average waiting time in queue

M/D/1 Equations Average Time in System (hours) Average Queue Length (number) Average Time in service (hours)

M/M/1 Queuing Models M -- Exponentially distributed arrival and departure times and one departure channel (server, e.g., runway) 1 – One runway q – Arrival (or departure) rate Q -- Service rate From statistics recall: Exponential distribution:

M/M/1 Queuing Models Average waiting time in queue Average time in system Average queue length Probability of k units in system: P(k)= (q/Q)k [1-(q/Q)]

Example (note different terminology) (1/2) End hour Operations Capacity D-C Cumul. 7 25 30 -5 8 9 40 10 50 20 11 45 15 12 -15 13 -20 14 -10 Arrival rate q = 250/9 = 27.8 A-C/hr Service rate Q = 30 A-C/hr Use M/M/1 model

Example (2/2) Average wait time Average queue length E(w)=q/[Q(Q-q)]=27.8/[30(30-27.8)] = 0.42 hr/A-C Average queue length E(m)=q2/[Q(Q-q)]=27.82/[30(30-27.8)] = 11.7 A-C Probability of no plane in the system P(0) = (q/Q)0[1-(q/Q)] = 0.073 Probability of one in the system (no line) P(1) = (q/Q)1[1-(q/Q)] = 0.068 Probability of two in the system (one in line) P(1) = (q/Q)2[1-(q/Q)] = 0.063 Continue, in same fashion