SlideShare a Scribd company logo
Chapter 14R (14.1 -
14.5) Waiting Line Models
     Matt Levy ISDS 2001
Introduction
Models to help managers understand and make decisions on the
operation of waiting lines.

Also known as a queue -- waiting line models are based on queueing
theory.

We are interested in the operating characteristics (a.k.a performance
characteristics) of waiting lines, which include the following:
 1. The probability that no units are in the system.
 2. The average number of units in the waiting line.
 3. The average number of units in the system (number of units in
    the waiting line + number being served)
 4. The average time a unit spends in the waiting line.
 5. The average time a unit spends in the system (waiting time +
    service time)
 6. The probability that an arriving unit has to wait for service.
General Waiting Line System Characteristics
Single Channel Waiting Line - Each customer entering an establishment passes through
one channel -- for example, one line and one order taking and filling station.

For most waiting line situations customer arrivals occur randomly and independently.

Quantitative analysts have found the Poisson distribution provides a good distribution
of the arrival pattern.

The probability function is as follows:


x = the number of arrivals in the time period
λ = the mean number of arrivals per time period (arrival rate)
e = 2.71828

While we can use this, in practice data should be recorded over a period of several days
or weeks and compared to the Poisson distribution.
General Waiting Line System Characteristics
Distribution of Service Times - the time a customer spends at a
service facility once a service has started.

Service time has been found to have an exponential probability
distribution.


µ = the mean number of units that can be served per time period (service rate)
e = 2.71828

Again, while we can use this, in practice data should be recorded over a period of
several days or weeks and compared to the Exponential distribution.

Additional Terms:
FCFS - First come first served -- this is the model we use in this section.
Transient Period - the beginning or start up period.
Steady-State Operation - normal state of operations.
Operating Characteristics - Single Channel Waiting Line Model with
Poisson Arrivals and Exponential Service Times
Operating Characteristics - Multiple Channel Waiting Line Model
with Poisson Arrivals and Exponential Service Times
These formulas are only applicable if:
  1. The arrivals follow a Poisson
     probability distribution
  2. The service time for each channel
     follows an exponential probability
     distribution.

λ = the arrival rate
µ = service rate
k = number of channels
General Relationships for Waiting Line
Models (this means shortcuts!)
The End

Problems: 1, 2-15 evens, but try the odds as well

See you Wednesday!

More Related Content

PPTX
queuing theory/ waiting line theory
PPT
Queuing theory
PPTX
Waiting line theroy
PPTX
Waiting line model(or presentation)
PDF
Waiting line system
PPT
Introduction to queueing theory
PPT
Queuing analysis
PPTX
Queuing theory
queuing theory/ waiting line theory
Queuing theory
Waiting line theroy
Waiting line model(or presentation)
Waiting line system
Introduction to queueing theory
Queuing analysis
Queuing theory

What's hot (20)

PPTX
Operational research queuing theory
PPTX
Queueing Theory and its BusinessS Applications
PPTX
Waiting lines
PPTX
Queuing theory .
PPTX
Queuing Theory
PPTX
Queuing unit v ppt
PPTX
Waiting Line Management Problem Solution, Writer Jacobs (1-15)
PPT
Q theory
PPTX
PPTX
Queing theory and delay analysis
PDF
Queuing theory
PPTX
Unit 4 queuing models
PPTX
Queuing theory and simulation (MSOR)
DOCX
Queuing theory
PPTX
Queuing theory
PDF
queueing problems in banking
PPT
Queuing Theory
PPTX
Queuing Theory
Operational research queuing theory
Queueing Theory and its BusinessS Applications
Waiting lines
Queuing theory .
Queuing Theory
Queuing unit v ppt
Waiting Line Management Problem Solution, Writer Jacobs (1-15)
Q theory
Queing theory and delay analysis
Queuing theory
Unit 4 queuing models
Queuing theory and simulation (MSOR)
Queuing theory
Queuing theory
queueing problems in banking
Queuing Theory
Queuing Theory
Ad

Viewers also liked (6)

PPT
File storageandbackupsystems
PPTX
London School of English Google Drive
PPTX
Share point 2010
PPTX
FM3 - Lesson 4 - One Drive
PPTX
drive, one drive, dropbox
PPTX
Slideshare ppt
File storageandbackupsystems
London School of English Google Drive
Share point 2010
FM3 - Lesson 4 - One Drive
drive, one drive, dropbox
Slideshare ppt
Ad

Similar to Chapter 14R (20)

PPT
Opersea report waiting lines and queuing theory
PDF
Solving Of Waiting Lines Models in the Bank Using Queuing Theory Model the Pr...
PPT
Management Course-314- Supply Chain Management
PDF
Management Queuing theory Lec 2
PPT
QUEUING THEORY
PPT
Queuingtheory 091005084417-phpapp01
PPTX
Queuing theory and simulation (MSOR)
DOCX
Chapter 18Waiting Lines© McGraw-Hill Education. All rights r
PPTX
Waiting Lines.pptx
PPT
modD.ppt modA.ppt operation management slide for business
PDF
queuingtheory-091005084417-phpapp01 (2).pdf
PDF
SolvingOfWaitingLinesModelsintheBankUsingQueuingTheoryModel.pdf
PDF
Heizer om10 mod_d
PDF
Waiting line mgmt
PPT
module d_7e.ppt
PPT
quening theory for the operations research
PPT
Unit iv-1-qt
PPT
Tn7 wtg.line+mgt
PPT
Tn7 wtg.line mgt
PDF
waiting, Queuing, best time an event cab be done at a time .pdf
Opersea report waiting lines and queuing theory
Solving Of Waiting Lines Models in the Bank Using Queuing Theory Model the Pr...
Management Course-314- Supply Chain Management
Management Queuing theory Lec 2
QUEUING THEORY
Queuingtheory 091005084417-phpapp01
Queuing theory and simulation (MSOR)
Chapter 18Waiting Lines© McGraw-Hill Education. All rights r
Waiting Lines.pptx
modD.ppt modA.ppt operation management slide for business
queuingtheory-091005084417-phpapp01 (2).pdf
SolvingOfWaitingLinesModelsintheBankUsingQueuingTheoryModel.pdf
Heizer om10 mod_d
Waiting line mgmt
module d_7e.ppt
quening theory for the operations research
Unit iv-1-qt
Tn7 wtg.line+mgt
Tn7 wtg.line mgt
waiting, Queuing, best time an event cab be done at a time .pdf

More from Matthew L Levy (10)

PPT
Chapter 15R Lecture
PDF
Chapter 5R
PDF
Chapter 4R Part II
PDF
Chapter 4 R Part I
PDF
Chapter 20 Lecture Notes
PDF
Chapter 18 Part I
PDF
Chapter 16
PDF
Chapter 15
PDF
Chapter 14 Part Ii
PDF
Chapter 14 Part I
Chapter 15R Lecture
Chapter 5R
Chapter 4R Part II
Chapter 4 R Part I
Chapter 20 Lecture Notes
Chapter 18 Part I
Chapter 16
Chapter 15
Chapter 14 Part Ii
Chapter 14 Part I

Chapter 14R

  • 1. Chapter 14R (14.1 - 14.5) Waiting Line Models Matt Levy ISDS 2001
  • 2. Introduction Models to help managers understand and make decisions on the operation of waiting lines. Also known as a queue -- waiting line models are based on queueing theory. We are interested in the operating characteristics (a.k.a performance characteristics) of waiting lines, which include the following: 1. The probability that no units are in the system. 2. The average number of units in the waiting line. 3. The average number of units in the system (number of units in the waiting line + number being served) 4. The average time a unit spends in the waiting line. 5. The average time a unit spends in the system (waiting time + service time) 6. The probability that an arriving unit has to wait for service.
  • 3. General Waiting Line System Characteristics Single Channel Waiting Line - Each customer entering an establishment passes through one channel -- for example, one line and one order taking and filling station. For most waiting line situations customer arrivals occur randomly and independently. Quantitative analysts have found the Poisson distribution provides a good distribution of the arrival pattern. The probability function is as follows: x = the number of arrivals in the time period λ = the mean number of arrivals per time period (arrival rate) e = 2.71828 While we can use this, in practice data should be recorded over a period of several days or weeks and compared to the Poisson distribution.
  • 4. General Waiting Line System Characteristics Distribution of Service Times - the time a customer spends at a service facility once a service has started. Service time has been found to have an exponential probability distribution. µ = the mean number of units that can be served per time period (service rate) e = 2.71828 Again, while we can use this, in practice data should be recorded over a period of several days or weeks and compared to the Exponential distribution. Additional Terms: FCFS - First come first served -- this is the model we use in this section. Transient Period - the beginning or start up period. Steady-State Operation - normal state of operations.
  • 5. Operating Characteristics - Single Channel Waiting Line Model with Poisson Arrivals and Exponential Service Times
  • 6. Operating Characteristics - Multiple Channel Waiting Line Model with Poisson Arrivals and Exponential Service Times These formulas are only applicable if: 1. The arrivals follow a Poisson probability distribution 2. The service time for each channel follows an exponential probability distribution. λ = the arrival rate µ = service rate k = number of channels
  • 7. General Relationships for Waiting Line Models (this means shortcuts!)
  • 8. The End Problems: 1, 2-15 evens, but try the odds as well See you Wednesday!