© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.

Slides:



Advertisements
Similar presentations
Lecture 10 Queueing Theory. There are a few basic elements common to almost all queueing theory application. Customers arrive, they wait for service in.
Advertisements

Introduction to Queuing Theory
Queueing Models and Ergodicity. 2 Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing models.
INDR 343 Problem Session
Lecture 13 – Continuous-Time Markov Chains
Queueing Theory: Recap
Queueing Model 박희경.
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
Queueing Theory (2). Home Work 12-9 and Due Day: October 31 (Monday) 2005.
Queuing Systems Chapter 17.
EMGT 501 Fall 2005 Midterm Exam SOLUTIONS.
Waiting Line Models And Service Improvement
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
Queueing Theory: Part I
Question 11 – 3.
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),
1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.
Management of Waiting Lines
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.
CHAPTER 18 Waiting Lines.
1 TCOM 501: Networking Theory & Fundamentals Lectures 9 & 10 M/G/1 Queue Prof. Yannis A. Korilis.
Chapter 18 Management of Waiting Lines
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
Chapter 9: Queuing Models
Lecture 14 – Queuing Systems

Queuing Theory (Waiting Line Models)
Queuing Models and Capacity Planning
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
Introduction to Management Science
Probability Review Thinh Nguyen. Probability Theory Review Sample space Bayes’ Rule Independence Expectation Distributions.
Introduction to Queueing Theory
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 18 Management of Management of Waiting Lines.
18 Management of Waiting Lines.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
1 Queueing Theory Frank Y. S. Lin Information Management Dept. National Taiwan University
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
1 Queuing Models Dr. Mahmoud Alrefaei 2 Introduction Each one of us has spent a great deal of time waiting in lines. One example in the Cafeteria. Other.
1 Elements of Queuing Theory The queuing model –Core components; –Notation; –Parameters and performance measures –Characteristics; Markov Process –Discrete-time.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Chapter 1 Introduction. “Wait-in-line” is a common phenomenon in everywhere. Reason: Demand is more than service. “How long must a customer wait?” or.
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.
Chapter 6 Queueing Models
(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.
Queuing Theory.  Queuing Theory deals with systems of the following type:  Typically we are interested in how much queuing occurs or in the delays at.
Adeyl Khan, Faculty, BBA, NSU Elements of Queuing System ArrivalsServiceWaiting line Exit Processing order System.
Waiting Line Theroy BY, PRAYASH NEUPANE, KARAN CHAND & SANTOSH SHERESTHA.
Queueing Fundamentals for Network Design Application ECE/CSC 777: Telecommunications Network Design Fall, 2013, Rudra Dutta.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Queuing Models.
Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.
1 BIS 3106: Business Process Management (BPM) Lecture Nine: Quantitative Process Analysis (2) Makerere University School of Computing and Informatics Technology.
Abu Bashar Queuing Theory. What is queuing ?? Queues or waiting lines arise when the demand for a service facility exceeds the capacity of that facility,
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
WAITING LINES AND SIMULATION
Chapter 1 Introduction.
Queueing Theory What is a queue? Examples of queues:
Management of Waiting Lines
Chapter 20 Queuing Theory
Queueing Theory II.
Lecture 13 – Queuing Systems
Queueing Theory Frank Y. S. Lin Information Management Dept.
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.
LECTURE 09 QUEUEING THEORY PART3
VIRTUE MARYLEE MUGURACHANI QUEING THEORY BIRTH and DEATH.
Presentation transcript:

© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory

© 2015 McGraw-Hill Education. All rights reserved. Introduction Queues (waiting lines) are part of everyday life, and an inefficient use of time Other types of inefficiencies –Machines waiting to be repaired –Ships waiting to be unloaded –Airplanes waiting to take off or land Queueing models –Determine how to operate a queueing system most efficiently 2

© 2015 McGraw-Hill Education. All rights reserved Prototype Example Emergency room at County Hospital is experiencing an increase in the number of visits –Patients are at peak usage hours often have to wait –One doctor is on duty at all times –Proposal: add another doctor –Hospital’s management engineer is assigned to study the proposal Will use queueing theory models 3

© 2015 McGraw-Hill Education. All rights reserved. Basic queueing process –Customers requiring service are generated over time by an input source –Customers enter a queueing system and join a queue if service not immediately available –Queue discipline rule is used to select a member of the queue for service –Service is performed by the service mechanism –Customer leaves the queueing system Basic Structure of Queueing Models

© 2015 McGraw-Hill Education. All rights reserved. Basic Structure of Queueing Models Calling population –Population from which arrivals come –Size may be assumed to be infinite or finite Calculations are far easier for infinite case Statistical pattern by which customers are generated over time must be specified –Common assumption: Poisson process Interarrival time –Time between consecutive arrivals 5

© 2015 McGraw-Hill Education. All rights reserved. Basic Structure of Queueing Models Balking –Customer refuses to enter queue if it is too long Queue is characterized by the number of members it can contain –Can be infinite or finite Infinite is the standard assumption for most models Queue discipline examples –First-come-first-served, random, or other 6

© 2015 McGraw-Hill Education. All rights reserved. Basic Structure of Queueing Models Service mechanism –Parallel service channels are called servers Service time (holding time) –Time for service to be completed –Exponential distribution is frequently assumed in practice 7

© 2015 McGraw-Hill Education. All rights reserved. Basic Structure of Queueing Models 8

© 2015 McGraw-Hill Education. All rights reserved. Basic Structure of Queueing Models Model notation example –M/M/s First letter refers to distribution of interarrival times Second letter indicates distribution of service times Third letter indicates number of servers M: exponential distribution D: degenerate distribution E k : Erlang distribution G: general distribution (any arbitrary distribution allowed) 9

© 2015 McGraw-Hill Education. All rights reserved. Basic Structure of Queueing Models Transient condition of a queue –Condition when a queue has recently begun operation Steady-state condition of a queue –Independent of initial state and elapsed time 10

© 2015 McGraw-Hill Education. All rights reserved. Basic Structure of Queueing Models 11

© 2015 McGraw-Hill Education. All rights reserved Examples of Real Queueing Systems Classes of queueing systems –Commercial service systems Example: barbershop –Transportation service systems Example: cars waiting at a tollbooth –Internal service systems Customers are internal to the organization –Social service systems Example: judicial system 12

© 2015 McGraw-Hill Education. All rights reserved The Role of the Exponential Distribution Operating characteristics of queueing systems determined by: –Probability distribution of interarrival times –Probability distribution of service times Negative values cannot occur in the probability distributions Exponential distribution –Meets goals of realistic, reasonable, simple, and mathematically tractable 13

© 2015 McGraw-Hill Education. All rights reserved. The Role of the Exponential Distribution Key properties of the exponential distribution –f T (t) is a strictly decreasing function of t 14

© 2015 McGraw-Hill Education. All rights reserved. The Role of the Exponential Distribution Key properties of the exponential distribution –Lack of memory Probability distribution of remaining time until event is always the same –The minimum of several independent exponential random variables has an exponential distribution –A relationship exists with the Poisson distribution 15

© 2015 McGraw-Hill Education. All rights reserved. The Role of the Exponential Distribution 16

© 2015 McGraw-Hill Education. All rights reserved The Birth-and-Death Process Birth –Arrival of a new customer into the queueing system Death –Departure of a served customer Birth-and-death process –Describes how the number of customers in the queueing system changes as t increases 17

© 2015 McGraw-Hill Education. All rights reserved. The Birth-and-Death Process Individual births and deaths occur randomly –Lack of memory is characteristic of a Markov chain Arrows in the diagram indicate possible transitions in the state of the system 18

© 2015 McGraw-Hill Education. All rights reserved. The Birth-and-Death Process Analysis is very difficult if the system is in a transient condition –Straightforward if a steady state condition exists For any state of the system: –Mean entering rate equals mean leaving rate Called the balance equation for state n 19

© 2015 McGraw-Hill Education. All rights reserved. The Birth-and-Death Process Key measures of performance for the queueing system 20

© 2015 McGraw-Hill Education. All rights reserved Queueing Models Based on the Birth- and-Death Process Models have a Poisson input and exponential service times The M/M/s model 21

© 2015 McGraw-Hill Education. All rights reserved. Queueing Models Based on the Birth-and- Death Process The M/M/s model as applied to the County Hospital example –See Pages in the text The finite queue variation of the M/M/s model –Called the M/M/s/K model –Queue capacity is equal to (K − s) 22

© 2015 McGraw-Hill Education. All rights reserved. Queueing Models Based on the Birth-and- Death Process The finite calling population variation of the M/M/s model –Given on Pages of the text –See next slide for diagram 23

© 2015 McGraw-Hill Education. All rights reserved. Queueing Models Based on the Birth-and- Death Process 24

© 2015 McGraw-Hill Education. All rights reserved Queueing Models Involving Nonexponential Distributions Poisson distribution does not apply when arrivals or service times are carefully scheduled or regulated –Mathematical analysis much more difficult Summary of models available for nonexponential service times –The M/G/1 model –The M/D/s model –The M/E k /s model 25

© 2015 McGraw-Hill Education. All rights reserved. Queueing Models Involving Nonexponential Distributions Summary of models available for nonexponential input distributions –The GI/M/s model –The D/M/s model –The E k /M/s model Other models deal with: –Hyperexponential distributions –Phase-type distributions 26

© 2015 McGraw-Hill Education. All rights reserved Priority-Discipline Queueing Models Queue discipline based on a priority system –Assumes N priority classes exist –Poisson input process and exponential service times are assumed for each priority class Nonpreemptive priorities –Customer being served cannot be ejected 27

© 2015 McGraw-Hill Education. All rights reserved. Priority-Discipline Queueing Models Preemptive properties –Lowest priority customer is ejected back into the queue Whenever higher priority customer enters queueing system Results for the nonpreemptive priorities model –Little’s formula still applies –See Pages in the text 28

© 2015 McGraw-Hill Education. All rights reserved. Priority-Discipline Queueing Models Results for the preemptive priorities model –Total expected waiting time in the system changes –For the single server case: 29

© 2015 McGraw-Hill Education. All rights reserved Queueing Networks Only a single service facility has been considered so far –Some problems have multiple service facilities, or a queueing network Two basic kinds of networks –Infinite queues in series –Jackson networks 30

© 2015 McGraw-Hill Education. All rights reserved. Queueing Networks Equivalence property –Assume that a service facility with s servers and an infinite queue has Poisson input with parameter λ and the same exponential service time distribution with parameter μ for each server (the M/M/s model) where s μ > λ Steady state output of this service facility is also a Poisson process with parameter λ 31

© 2015 McGraw-Hill Education. All rights reserved The Application of Queueing Theory Queueing system design involves the selection of: –Number of servers at a service facility –Efficiency of the servers –Number of service facilities –Amount of waiting space in the queue –Any priorities for different categories of customers 32

© 2015 McGraw-Hill Education. All rights reserved. The Application of Queueing Theory Primary considerations in decision making –Cost of service capacity provided by the queueing system –Consequences of making customers wait in the queueing system Approaches –Establish how much waiting time is acceptable –Determine the cost of waiting 33

© 2015 McGraw-Hill Education. All rights reserved. The Application of Queueing Theory Other issues –Waiting cost may not be proportional to amount of waiting Might be a nonlinear function –Is it better to have a single fast server or multiple slower servers? 34

© 2015 McGraw-Hill Education. All rights reserved Conclusions Queueing theory provides a basis for modeling queueing systems –Goal is to achieve an appropriate balance between cost of service and cost of waiting The exponential distribution plays a fundamental role in queueing theory Priority-discipline queueing models –Appropriate when some categories of customers given priority over others 35