Scribd
Upload
26 views2 pages

2

For single-server systems, the probability of having n customers, waiting longer than t, or time-in-system longer than t can be computed. For multiple servers, spreadsheets are available. Determining optimal capacity requires balancing the costs of providing service and customer waiting. The document also discusses extensions to allow for non-exponentially distributed arrival and service times.

Uploaded by

Sanjaya Neupane
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
26 views2 pages

2

For single-server systems, the probability of having n customers, waiting longer than t, or time-in-system longer than t can be computed. For multiple servers, spreadsheets are available. Determining optimal capacity requires balancing the costs of providing service and customer waiting. The document also discusses extensions to allow for non-exponentially distributed arrival and service times.

Uploaded by

Sanjaya Neupane
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

Other Performance Measures

For single-server case, some other performance measures can be computed as


following:
Probability that there are n customers in system
Probability that wait is greater than t =
Probability that time-in-system is greater than t =
For more than one server, spreadsheets are available to compute these measures.

Determining Capacity
If we increase capacity (by increasing m or by increasing ), we expect that the
cost of providing that capacity will increase. We also expect, however, that the
customers will wait less and that the cost of customer waiting will decrease. This
suggests that we should look at the total cost = (cost of providing service + cost
of customer waiting) in order to make decision about how much capacity to provide.

For example, if Orin café pays $15 per hour to a cashier then adding one more
cashier increases the cost of providing capacity by $15 per hour. But it also
reduces the number of customer in system from (see above) to ( from table for
m=2 and then repeat the above steps to get ). If we assume that a customer’s time
is worth $20 per hour then system saves (1-0.533)*$20 per hour = $9.34. Therefore,
in this example, from total system cost perspective, we should not add another
server.

Other Extensions
Without making much fuss about it, we have made two significant assumptions about
the pattern of variability in arrivals and service: Poisson distribution for number
of arrivals and Exponential distribution for service times. These assumptions mean
the following: coefficient of variation =(standard deviation / mean) for
interarrival times and
coefficient of variation =(standard deviation / mean) for service times . But what
if based on measurement of real data, they are not 1? We call this the case of
general arrivals and service.

It is easy to compute Lq in this more general case as follows:

Starting from , other performance measures can be computed in the same way as
earlier.

Summary
Arrival rate lambda = 1 / (interarrival time, that is time between two arrivals)
Service rate mu = 1 / service time
Number of servers m
Utilization rho
Assume arrivals Poisson distribution and service time are exponentially
distributed.
Average number in waiting line Lq can be obtained from table (given and m)
In case number of servers m=1, we can also use
Average waiting time from Little’s Law
Average time-in-system (waiting time +service time)
Average number-in-system (waiting+getting served)
Probability that there is nobody in the system P0 is available in table.
For single-server case, m=1, we have following three formulas:
Probability that there are n customers in system
Probability that wait is greater than t =
Probability that time-in-system is greater than t =
Determination of capacity is a trade-off between cost of service capacity and cost
of customer waiting.
Coefficient of variation of interarrival times Ca = (Std.dev./mean of interarrival
times)
Coefficient of variation of service times Cs = (Std.dev./mean of service times)
If , modify Lq from above by multiplying it with

You might also like