A Queuing System: Avg Time in System Avg Number in System
A Queuing System: Avg Time in System Avg Number in System
Average Wait
in Queue (Wq )
Service
Arrival Departure
Rate (
Average Number Rate (
in Queue (Lq )
Served
Calling Jobs Service Jobs
Queue Mechanism
Population
leave the
system
Arrival Queue
Process Discipline
Service
Queue
Process
Configuration
4
Principal Queue Parameters
1. Calling Population
2. Arrival Process
3. Service Process
4. Number of Servers
5. Queue Discipline
5
1. The Calling Population
• Population of customers or jobs
• The size can be finite or infinite
– The latter is most common
• Can be homogeneous
– Only one type of customers/ jobs
• Or heterogeneous
– Several different kinds of customers/jobs
6
2. Arrival Process
• In what pattern do jobs / customers arrive to the
queueing system?
– Distribution of arrival times?
– Batch arrivals?
– Finite population?
– Finite queue length?
• Poisson arrival process often assumed
– Many real-world arrival processes can be modeled
using a Poisson process
7
3. Service Process
• How long does it take to service a job or
customer?
– Distribution of arrival times?
– Rework or repair?
– Service center (machine) breakdown?
• Exponential service times often assumed
– Works well for maintenance or unscheduled service
situations
8
4. Number of Servers
• How many servers are available?
Single Server Queue
9
Example – Two Queue Configurations
10
Multiple v.s. Single Customer Queue
Configuration
Multiple Line Advantages Single Line Advantages
11
5. Queue Discipline
• How are jobs / customers selected from the queue
for service?
– First Come First Served (FCFS)
– Shortest Processing Time (SPT)
– Earliest Due Date (EDD)
– Priority (jobs are in different priority classes)
• FCFS default assumption for most models
12