Professional Documents
Culture Documents
Cliff T. Ragsdale
Queuing Costs
$
Total Cost
Service Level
...
Waiting Line
Server
Customer Leaves Customer Leaves Customer Leaves Customer Leaves Customer Leaves Customer Leaves Customer Leaves
Server 1
Customer Arrives
...
Waiting Line
Server 2
Server 3
...
Customer Arrives
Waiting Line
Server 1
...
Waiting Line Server 2
...
Waiting Line Server 3
Pe P( x ) ! , for x = 0, 1, 2, ... x!
where P is the arrival rate (e.g., calls arrive at a rate of P=5 per hour) See file Fig13-3.xls
x P
t2
where Q is the service rate (e.g., calls can be serviced at a rate of Q=7 per hour) The average service time is 1/Q. See file Fig13-4.xls
Comments
If arrivals follow a Poisson distribution with mean P, interarrival times follow an Exponential distribution with mean 1/P. Example Assume calls arrive according to a Poisson distribution with mean P=5 per hour. Interarrivals follow an exponential distribution with mean 1/5 = 0.2 per hour. On average, calls arrive every 0.2 hours or every 12 minutes. The exponential distribution exhibits the Markovian (memoryless) property.
Kendall Notation
Queuing systems are described by 3 parameters: 1/2/3 Parameter 1
M = Markovian interarrival times D = Deterministic interarrival times
Parameter 2
M = Markovian service times G = General service times D = Deterministic service times
Parameter 3
A number Indicating the number of servers.
Examples, M/M/3
D/G/4
M/G/2
Operating Characteristics
Typical operating characteristics of interest include:
U - Utilization factor, % of time that all servers are busy. P0 - Prob. that there are no zero units in the system. Lq - Avg number of units in line waiting for service. L - Avg number of units in the system (in line & being served). Wq - Avg time a unit spends in line waiting for service. W - Avg time a unit spends in the system (in line & being served). Pw - Prob. that an arriving unit has to wait for service. Pn - Prob. of n units in the system.
L ! PW
1 Wq ! W Q
L q ! PWq
There are s servers. Arrivals follow a Poisson distribution and occur at an average rate of P per time period. Each server provides service at an average rate of Q per time period, and actual service times follow an exponential distribution. Arrivals wait in a single FIFO queue and are serviced by the first available server. P< sQ.
70.0% 87.41% 0.3000 0.1259 0.8393 3.1198 1.5393 3.9939 0.2398 0.7138 0.4398 0.9138
The M/D/1 model can be used in these types of situations where the service times are deterministic (not random). The results for an M/D/1 model can be obtained using the M/G/1 model by setting the standard deviation of the service time to 0 ( W= 0).
Simulating Queues
The queuing formulas used in Q.xls describe the steady-state operations of the various queuing systems. Simulation is often used to analyze more complex queuing systems. See file Fig13-21.xls
End of Chapter 13