Waiting Line Management: Unit Introduction
Waiting Line Management: Unit Introduction
Management
Unit Introduction
The phenomena of waiting are common in business and industry. In most
business situations, the customers are the machines, not people, like trucks
waiting to be unloaded, ships waiting to dock, orders waiting to be filled, jobs
waiting to be processed. Waiting is annoying, but we do wait. Given time most of
the facilities can process more than they are called upon to process. The waiting
line theory or queue theory is commonly used in planning and analyzing service
capacity of a system. Based on type of the structure a specific queue model, from
innumerous models, is applied. The main characteristics under consideration are,
the arrival pattern of customers, queue discipline, length of the queue, queue
behavior etc. Because there are large number of possible models, a notation set
has been developed by D.G. Kendall that makes it easy to identify the model
applicable for a particular system. After finding out the values of different
measures of performance, the next is to determine the efficiency of the service
system. At the very beginning it should be remembered that all the measures of
performances are not required to determine the efficiency of the system.
Therefore this unit will include a discussion on introduction of the concept of
waiting line management, characteristics of waiting line, and the methodologies
of waiting line management.
School of Business
Lesson Objectives
After completing this lesson you will be able to:
Explain the theories of satisfaction
Discuss the quality factors affecting satisfaction
Justify the customer’s reaction to delay
Describe the methods of delay management
Many things in life are worth waiting for. We would not mind waiting for the
course completion to earn an MBA. We love to wait for good news from our dear
ones. Waiting in line is common in our day to day life. We wait in line to avail
buses, to deposit our money in the bank, to pay bills, to buy goods or to use lift.
The phenomena of waiting are also common in business and industry. We find
mechanics waiting for their tool cribs or standing idle for mechanics. Students
wait for photocopy of books. In most business situations, the customers are the
machines, not people, like trucks waiting to be unloaded, ships waiting to dock,
orders waiting to be filled, jobs waiting to be processed.
Waiting is annoying, but we do wait. It is estimated that we spend at least 10% of The waiting line theory
our working moments waiting. Given time most of the facilities can process more is a mathematical
than they are called upon to process. But still, because of the random nature of approach not only to
analyze waiting times,
arrival of customers, waiting is bound to occur. The waiting line theory or queue
but also used in large
theory is commonly used in planning and analyzing service capacity of a system. number of situations
It is a mathematical approach not only to analyze waiting times, but also used in
large number of situations for example,
• to determine the number of beds in a hospital or required size of a
restaurant
• to determine the number of runways in an airport
• to determine the number of lifts in a building or the number of ATM
machines in a bank branch
• to determine the number of switches in a telephone box
• to schedule delivery of jobs.
Delay in service has a direct bearing on customer’s satisfaction. To reduce
delays, management needs to expand capacity. But it is expensive to increase
capacity. Managers have to weigh the cost of providing additional capacity
against potential decrease in delays in service. Therefore, management is
interested in finding the appropriate level of service that will ensure the customer
satisfaction.
have to wait to buy tickets for bus; they also have to wait for transport and get
held up in traffic jams. For the individuals it is frustrating to wait. For the
economy it is wasteful because people waiting for service is neither consuming
nor they are producing. But the service providers are unable to remove delays in
their system. Even if they plan for peak demand they still end up with queues in
their system. Waiting for service is a result of the random arrival of the
customers. Customers arrive for service at random, creating localized peaks and
valleys in demand pattern. In most service outlets arrival of customers cannot be
programmed or scheduled. Researches show that, on average, people wait for
more than half an hour each day for different services and appointments.
a) Evaluation of service: Organizations that create delay by poor design of
their service facilities do so at their own peril. The customers consider
waiting a punishment, and they associate it with the whole service
experience. The longer the delay the lower is the evaluation of the whole
system. Many of our local organizations, specially the nationalized
institutions like banks, do not notice the irritations caused by delay.
b) Difference in Perception: There is a perpetual difference in opinion
Customers perceive to regarding the length of delays between the provider of service and the
waited long to get service customer. Customers always perceive to have waited long where as on the
where as employees feel other side the employees feel that the customers did not have to wait long.
that customers did not
wait long.
Research found that when a customer at a bank thought the average delay
was 5.6 minutes the staff perception was 3.2 minutes and the actual delay
was 4.7 minutes.
c) Type of Dissatisfaction associated with delay: There are two types of
dissatisfaction associated with delay. A low involvement discontents when
delay is predicted and a high involvement affects when delay is not
predictable. As delays become more common and impose a more frequent
time-cost, people find it easier to put up with it.
d) Reasons for delay: If people are informed in advance as to the reason for
delay, they are less irritated and are patient in their waiting. The provision
of delay information is now standard among the transport operator, such as
airlines. Such information seems to be much appreciated despite the fact
that it does nothing to reduce waiting time.
e) Entertainment during Delay: People are less dissatisfied by delays if they
can fill in their waiting time. For example, ANZ Grindlays Bank at their
Dhanmondi branch provides TV entertainment to their customers waiting
in queue; another is the provision of mirror in places where people have to
wait, e.g., at lifts in buildings. Additional examples are places where
waiting is very frequent, to provide the latest newspapers and magazines
for the customers to read. Research has shown that many of those waiting
do not even realize that they had been held up.
f) Control on delay: People become more irritated when they believe that the
service provider has control over the situation. If delays are beyond the
control of the providers, the customers are more tolerant to delays. For
example, airplane delayed due to inclemental weather does not create
negative impression about the provider. But on the other hand if the
customer believe that the delay is a result of slow check-in at the counter it
is bound to create negative feeling about the provider.
g) Delay at the beginning or end of the process: When delay occurs at the
beginning or at the end of the process it is evaluated more negatively than
when it occurs at the mid-process. It is better to impose delays in the
middle of the process, rather than at the end or beginning. In a restaurant it
is more appropriate to impose delay in providing food, but not to keep the
customers waiting before taking orders.
h) Value of exchange: People expect that their cost of waiting to be
compensated by appropriate rewards. This implies that those receiving
benefits in an exchange would be more tolerant to delays than those
incurring costs. For this reason, in a bank, those are in queue to pay bills
complain more than those waiting to encash their cheques.
Delay Management
Among the many quality dimensions that contribute to satisfaction or
Management of service
dissatisfaction of customers, delay is one of the major and immediate organizations should
contributors to dissatisfaction. This is amply clear from the discussion in the attempt to reduce delay in
previous section. Management of service organizations should attempt to reduce providing services.
delay in providing services. There are three approaches that managers can adopt
to reduce delays:
1. Operations management
2. Influencing demand
3. Perception management
1. Operations management: Wherever feasible, management should try to
avoid delays by increasing service supply. This they can do by increasing
number of counter at peak hour and reduce it at off peak hours. Or they can
use experienced and quick workers during peak hours. This is easy to say but
very difficult to maintain. It is very expensive to provide additional facilities.
To plan for peak demand situation will result in under utilization at non-peak
hours. Because of the random nature of customer arrival, even if
management decides to provide for peak demand, they still will face delays
in their services. Some make use of part-time workers, others train their non-
service workers to assist the service workers during peak periods, and still
others use fast automatic machines.
2. Influencing demand: The second approach is to regulate demand or
influence demand to occur at specific time. Scheduling appointments, as Providing incentive is
done by doctors for non-emergency patients, is one good example of another method of
regulating demand for service. Providing incentive is another method of regulating demand.
regulating demand. For example, using differential price to shift demand to
particular period, e.g., Mondays are cheap days at the cinema in Britain.
Some even segment their customers according to the nature of service
required. If a group of customers need something that can be done very
quickly, they are given special line so they do not have to wait for the slower
customers. For example, at some departmental stores the customers with less
than five items have a fast channel to check out, whereas, customers with
more than five items have to pass through a slow line.
3. Perception management: The third approach is to try to ensure that the Queuing ticket system
allows the customer to
customers see the delay in a favorable way. By supplying delay information conduct other business
customers can be made more tolerant to delays. By providing diversions can while waiting.
the customers be made less dissatisfied to delays, like providing
entertainment as they wait for service. Another way is the queuing ticket
system that allows the customer to conduct other business while waiting. For
example, in banks, the customers can sit down and read instead of standing in
line. But this approach implies that delay is normal and management is only
interested in alleviating the discomfort of waiting, not in eliminating it.
Employees that are not part of service should be kept out of sight. Nothing is
more frustrating to someone waiting in line to see employees, who potentially
could be serving those in line, doing nothing or working on other activities.
Greeting the customers by name, or providing some other special attention, can
go a long way toward overcoming the negative feeling of a long wait.
Psychologists suggest that the workers should invoke friendly actions such as
smiling when greeting or serving. Test result shows significant increase in
perceived friendliness of the servers in the eyes of the customers when the
servers smile while dealing with customers.
Discussion questions
1. Describe the different theories of consumer satisfaction.
2. Describe the factors that influence consumers’ satisfaction?
3. How do consumers respond to delay?
4. What should management do to manage delays?
Lesson Objectives
After completing this lesson you will be able to:
Describe the major characteristics of waiting line
Explain the arrival pattern
Discuss the service pattern
In structuring a waiting line model the inputs are called arrival. The arrival times
and service times are controlled by different probability processes. The output
rate of the system is dependent on the interplay of arrival pattern and service
pattern. Based on the probability distribution of arrival and services the basic
values of the parameters under study can be determined. The Figure 7.2.1 shows
a typical queuing system with its different components.
major concern for the analyst to determine whether the source for potential
customer is finite or infinite. A finite population source refers to the limited size
customer pool that will use the service. If the source is finite, and a customer
leaves the population and joins the system for service, the population gets
reduced which, in turn, reduces the probability of creation of next demand for
service. For example, a photocopy machine in an office has a finite population
source. Demand for its use can arise from among that office employees, no one
outside the office can use the machine. So if an employee uses the machine, the
chance of another using it is very small. If the population source is too small it
may even affect the probability of an arrival.
Arrivals can also be controlled or uncontrolled. The arrivals at a system are more
controlled than is generally recognized. Barbers may decrease their Friday
arrivals by charging more than other weekdays, or a doctor, in a private clinic,
not seeing more than a fixed number of patients a day. The simplest of all arrival-
control devices is having fixed business hours. But some service demands are
clearly uncontrollable, like hospital emergencies. Controlled arrivals are more
common than uncontrolled.
Arrivals can also be single or in batches. Customers can arrive in batches, such as
the arrival of family to a restaurant or garment factories receive orders for a
particular item in batches. When customers arrive individually or singly it is
called single arrival. For example, a housewife going for shopping at 1-Stop
Mall; a student going for class; or a person waiting to use the lift in a building.
c) The distribution of customer arrival: The arrival of customers for Arrival of customers for
services can be described as either average arrival rate or as average inter- services can be described
arrival time. Average arrival rate means the average number of arrivals per a by either average arrival
rate or by the average
given time and average inter-arrival time means the average time between inter-arrival time.
arrivals, that is, the time between one arrival and the next. In case of scheduled
arrivals, the arrival rate is relatively predetermined, while that in unscheduled it
is a random variable and therefore we have to find its average time and also need
to find out its frequency distribution.
In scheduled arrival the arrival distribution is generally constant with exactly the
same time period between successive arrivals, as shown in the Figure: 7.2.1. It
would have same inter-arrival time (t) and with variance zero (0). But in case of
random arrivals, the time between arrivals would vary and would have a positive
variance. When arrivals at a service outlet occur on a purely random fashion, a
plot of the inter-arrival times yield an exponential distribution (Figure 7.2.2).
t t t t t t
Constant Arrivals
Intervals = t and variance = 0
t1 t2 t3 t4 t5 t6
T
Random Arrivals
Intervals t1 ≠ t2 ≠ t3 ≠ t4 ≠ t5 ≠ t6
Variance >0
Figure: 7.2.1 Constant Arrivals and Random Arrivals
But when one is interested in the number of arrivals during a given period of time
(T), the distribution appears as shown in Figure 7.2.3. If the arrival process is
random, the distribution is Poisson. Random arrival means that even if the mean
number of arrivals in a time period is known, the exact moment of arrival cannot
be predicted. Thus each moment in the time span has the same chance of having
an arrival. Such behavior is observed when arrival is independent of each other
and one arrival does not affect the chance of other future arrivals.
Mixed
Figure 7.2.4: Single line, Multiple line, and Mixture physical flow of customer
whereas, others may pass through each phase. Arrangements are flexible and
customers have the option to choose the sequence of services to avail.
Systems that have capacity or time limitations generally restrict the queue size. If
the queue length is finite or limited, the customer cannot enter the system when it
is full. Typical examples of finite queues are full lifts in busy buildings or full
parking lots or private practicing doctors refusing to see more than a fixed
number of patients a day. Note that, if the queue size is finite, then the system
size is also finite. Restricted queue size influences the actual arrival distribution,
because the customer denied entry may rejoin the population, or may try again or
may seek service elsewhere. These actions have impact on the population size
specially when the population is finite.
getting served. Customers waiting in line are either impatient or patient. Those
who renege or bulk are called impatient customers. Patient customers are those
Customers refuse to join a
line when they see a very
who enter the system and do not leave till served. But patient customer, while
long line and chances of waiting for service, seeing a shorter line may switch between lines. This is called
getting quick service are jockeying. Customers also recycle by returning to the queue immediately after
very low. obtaining service. This phenomenon is commonly observed when the authority
restricts the number of tickets that an individual can buy as in Pepsi Asia Cup
Tournament.
i) The exit of customer from the system: Once the customer is served,
two exit fates are possible: (a) the customer may return to the population source
and immediately become candidate for re-arrival, or (b) the customer exits the
system but does not return to the calling population. The first case can be
illustrated by the customer who patronage the same restaurant for every meal or
the machine in a factory that has been repaired and has joined production line. In
the second case, the served customer has a zero probability of returning for re-
service. For example, a patient who had an appendectomy operation will never
require a second similar operation. If the population is finite the non-return of
served customer to the population will modify the population structure and will
also modify the arrival rate for service.
Discussion questions
1. Explain how the source population can affect arrival rate.
2. What do you mean by arrival pattern?
3. Describe the common service system structure in use.
4. What do you mean by single-channel-multi-phase queue?
5. Describe, in brief, the different components of a service system.
Lesson Objectives
After completing this lesson you will be able to:
Explain the managerial problems in waiting line situation
Describe the methodology of queue analysis
The manager must weigh the added cost of providing more rapid service against
the inherent cost of waiting. Unfortunately, the two costs are in direct opposition
to each other, as shown in Figure 7.3.1. That is, the cost of providing service
increases with the increase in service level, while the waiting cost declines with
the increase in service level. For simplicity, in the figure, the cost of providing
service is shown to have linear relationship. Although a step function is often
more appropriate, use of a straight line does not distort the picture. As capacity
increases, the number of customer waiting decreases. As is typical in a trade-off
relationship, total cost is U-shaped. The goal of analysis is to find the service
level where the total cost is minimum.
costs. Thus, cost of capital increases with the increase in facility or service
level. Operating cost includes cost of labor, energy, and materials required
for the additional facility. Additional facility would require additional
maintenance, repair, insurance, taxes, rental of space, and other fixed costs.
ii. Waiting Cost of Customers: Customers waiting for service also incur
Longer the people wait the
cost. A customer who is waiting is not producing. The longer they wait the longer the time they waste
longer the time they waste in non-productive activity. In some cases, it is in non-productive activity.
easy to assess the cost of waiting. When the customer belongs to the same
organization as those providing services, the cost of waiting is the wage
wasted while waiting. For example, if a worker has to wait in line to use a
computer, his waiting cost is the wage for the period he has to wait for the
computer.
Therefore, the total cost (TC) of a queue system are equal to the sum of cost of
providing service (CF) and the cost of waiting (CW). That is,
TC = CF + CW
Where,
TC = Total cost of the system
CF = Cost of providing service
CW = Customers' cost of waiting for service
The cost of waiting (CW) per unit time for the queuing system as a whole is given
by:
CW = WλC = LC
Where,
CW = Total cost of waiting
W = Average time waiting in the system
λ = Customer rate of arrival
C = Waiting cost per customer
L = Average number of customer in the system
The management may have the objective of minimizing total cost of services
(both facility and waiting cost) or achieving a specific level of services or both.
i. Cost minimization: Where both the facility cost and waiting cost can be
assessed easily, management would try to provide a service level that
would minimize total cost of the system.
ii. Specific service level: As a policy matter management may try to
achieve a specific level of service, disregarding the cost of service. For
example, a fast food restaurant advertise that customer does not have to
wait for more than three minutes for a burger, or a private mobile
telephone company promise to provide new connection within 24 hours,
or a service facility should be in use at least 75 percent of the time.
Determining the best level of service is a matter of organization policy
and is influenced by external factors as competition and consumer
pressures, etc.
the airport but before availing flight out of the city the passengers
need space where they can wait.
iii. Waiting time in line: Short lines do not always mean a good service
level neither a long line implies a bad service level. Efficient system
can service large number of customers in short period whereas
inefficient system may take long to do so. So it is important for the
operations manager to know, on average, how long do the customers
have to wait in line. If they have to wait too long the customers
would perceive the service as poor.
iv. Total time in the system: Total elapsed time in the system is also
important from operations point of view. If customers spend too long
a time in the system it either indicates the need to change customers'
behavior or the capacity needs to be increased.
v. Utilization rate of the facility: On the surface, it might seem that the
Too little idle time
operations manager would want to seek 100 percent utilization.
indicate under capacity.
However, too little idle time indicates under capacity. Increase in
system's utilization can be achieved only at the expense of long
waiting and long queues for the customers. Management's goal is to
maintain high utilization rate without adversely affecting other
performance criteria.
vi. Probability that an arriving customer must wait for service and
number of customers in the system: This criteria gives indication of
the chance of a particular number of customer in the system. If the
probability is high then the operations manager has to ensure
facilities for the expected number of customers. But if it low he may
have to reduce waiting space capacity.
vii. Implied cost related to the level of service: The manager also would
like to know the cost associated with different service levels and the
justification behind such cost. If the return against investment is not
right, even if the capacity is under staffed, the manager may not opt
for high investment in the facility. But placing taka value to service
level is not easy. In such situation, the operations manager must
weigh the cost of alternative arrangements and use subjective
assessment to select the best alternative.
Discussion Questions
1. What are the main objectives of analyzing a queue system?
2. Describe the different costs associated with a queue system.
3. Describe the procedure of analyzing a queue system.
4. Describe the relation, with the help of a graph, between different components
of a queue system.
5. Describe the important factors taken into consideration in measuring
performance of a system.
Lesson Objectives
After completing this lesson you will be able to:
Read Kendall's notations
Describe the parameters of a single server model
Make comparative analysis of a single server system
(a/b/c) : (d/e/f)
All of these features of a service system have already been discussed in the
previous lesson. In addition, to represent different characteristics of each of these
features more standard symbols are commonly used. They are described in the
Table 7.4.1.
Population α No limit
Finite Actual number (1, 2, 3, etc)
The notation for the simple one server single-phase queue is,
(M/M/1) : (FCFS/α/α)
It stands for Poisson arrival rate (M), exponential service time (M), one server
(1), a first-come-first served discipline (FCFS), and infinite queue length (α) and
infinite calling population (α). If there are two servers in the system, and a
maximum of 25 customers allowed in the system, and all other parameters
remaining the same, then the notation would be:
(M/M/2) : (FCFS/25/α)
There are various queue situations, for example, queue with priority, cyclic
queue, truncated queue, and many others. In theory there are innumerable
number of queue models. With difference in any one of the features of the system
and difference even in the distribution of each of the features a unique model, for
that particular situation, is applicable. Before analyzing any queue system, it is
very important to identify the right model otherwise the resulting system
parameters would not be the correct parameters of the system under study. Some
commonly observed waiting line models are shown in the Table 7.4.2.
In this lesson we would present a sample waiting line model. There are many
more types of queue models than the one shown here. While using the formula, it
is important to keep in mind that it is a steady-state formula derived on the
assumption that the process under study is an ongoing concern with no chance of
change in arrival and service rates. Steady state of a system occurs when the
system is independent of the initial conditions and elapsed time. In other words,
the system is not in a transient state when its measures of performance are still
dependent on the initial conditions of changing arrival and service pattern.
EXIT
iii. Average number of customers in the system (L): This parameter included
both the numbers of customers waiting in line and those being served.
λ
L =
µ - λ
iv. Queue length or average number of customer in line (Lq): Average number
of customer in queue measures the average number of customers waiting in
line and their service is yet to start.
2
λ
L q =
µ(µ − λ)
v. Utilization rate of the facility or the probability of the system being busy
(Pb): The probability that the system is busy, is the same as not finding an
empty system. It measures the proportion of time that the server is busy
serving the customers.
λ
P b = = 1 − P e = ρ
µ
vi. Probabilities of an empty system or the system not busy (Pe): The probability
that the system is empty means the proportion of time there is no customer
in the system and the server is ideal.
λ
P e = 1
= 1 − Pb −
µ
vii. Probability of a customer being in the system (waiting and being served)
longer than time t (P{T>t}): The probability that a customer spends a total
time more than time "t" includes the time spend waiting and the time
required for service.
P{T > t} = e (λ - µ )t
Where,
e = 2.718 (a constant)
T = Time in the system, and
t = A specific time, say 8 minutes, etc.
viii. Probability of a customer being in the system (only waiting but not yet being
served) longer than time t' (P{T'>t'}): The probability a customer spends a
time more than t' time waiting in line before the start of his/her service, is
λ (µ λ) t'
> t' } = (e )− −
P{T'
µ
Solution
In this problem the arrival is Poisson and service is negative exponential
distributed with only one server, therefore,
i. Total time in the system or average waiting time (W): On average each
patient spends 2.0 hours (waiting and being treated) in the clinic.
1 1 1
W = = = = 2 . 0 hours
µ − λ 7.5 − 7 0.5
It is the time that elapses between the moment the patient entered the clinic
and left the clinic.
ii. Average waiting time in line (Wq): The first parameter indicates that the
patient spends a long time in the clinic. It includes both waiting and getting
treatment. But the performance measure does not tell us anything about the
proportion of time that the patient spends getting treated. If the proportion of
time getting treated is longer than the proportion of time waiting for
treatment, then the long time spent in the clinic is justified, otherwise not. By
finding Wq we would be able to determine, out of the total time, the time the
patient waited for treatment.
λ 7.0 7.0 7.0
W = = = = = 1.87 hours
µ (µ − λ ) (7.5 ) (0.5 )
q
7.5 − 7.0 7.5 3.75
The performance measure produces a very gloomy picture. Out of two hours
spent in the clinic, each patient on average spends 1.87 hours in waiting. In
other words, for a 7.8 (2.0-1.87 hours) minutes of treatment, each patient has
to wait for 1 hour and 52.2 minutes.
λ 7.0 7.0
L = = = = 14 patients
µ - λ 7.5 − 7.0 0.5
On average the clinic will always have 14 patients, either waiting for
treatment or being treated. The operations manager has to ensure that
sufficient space is there to accommodate the patients.
iv. Queue length or average number of customer in line (Lq): This parameter
measures the average number of customers waiting in line waiting for
their turn to consult the doctor.
Lq =
λ2
=
(7.0 )2 =
49
= 13.07 patients
µ(µ − λ) 7.5 (7.5 − 7.0 ) 3.75
v. Utilization rate of the facility or the probability of the system being busy
(Pb): To measures the proportion of time that the server is busy serving
the customers we would use the following formula.
λ 7.0
Pb = = = 0.9333 = 93.33 %
µ 7.5
This parameter indicates that the doctor is busy 93.33% of the time. This
is too high a utilization rate of resources. The doctor is too busy he does
not have time for rest, which may lead to inefficiency in the long run.
vi. Probability of an empty system or the system not busy (Pe): The
probability that the clinic is empty, or in other words, the doctor is not
busy is,
λ 7 .0
Pe = 1 − = 1 − = 1 − 0 . 933 = 0 . 06
µ 7 .5
That is, the probability of a patient being in the clinic more than one and
a half hour, that includes the time for waiting and the time for treatment
inclusive.
P{T > t} = e (λ - µ )t
= 2.718 (7.0 − 7.5 )1.5
= 2.718 − 0.75
1
= 0.75
= 0.4724 = 47.24% of the time
2.718
vi. Probability of a customer being in the system (only waiting but not yet
being served) longer than time t' (P{T'>t'}): The probability a customer
spends a time more than t' time waiting in line before the start of his/her
service is,
λ (µ λ) t'
P{T' > t' } = (e )− −
µ
For our example we would like to know the probability of waiting for
service for more than one hour is,
7.0
P{T' > 1.0} = (2.718 ) − (7.5 − 7.0 )1.0
7.5
= (0.93333 )(2.718 )− 0.5
0.93333
=
2.718 0.5
= 0.5661 = 56.61% of the time
There is 56.61% chance that a patient has to wait more than 1 hour
before he/she gets to see the doctor.
n + 1
λ
P{N > 8} =
µ
8+1
7 .0
=
7 .5
= (0 . 933 )9
= 0 . 5374
Management Decision
After finding out the values of different measures of performance, the next step is
All the measures of
performances are not
to determine the efficiency of the service system. At the very beginning it should
required to determine the be remembered that all the measures of performances are not required to
efficiency of the system. determine the efficiency of the system. Depending on the nature and desire of the
management different sets of parameters are evaluated for determining the
efficiency.
There are two ways to determine the efficiency of the system. One method is to
have a set of values for each parameter, previously determined as desirable, and
compare the result against them. If the computed results matches or are within
acceptable range of the predetermined values the system it is assumed to be
performing satisfactorily, otherwise not. The second method is to apply cost
analysis on multiple of alternative systems, and select the alternative that gives a
satisfactory cost analysis.
Let us assume that the management already has a set of performance criteria
available for each of the measures of performance. Let us also assume that they
would prefer their system to meet the standards. The Table 7.4.3 given below
shows a comparative study of the desired results and the computed results.
The present arrangement is not satisfactory. The management has to find solution
to the problem. They may try to make the doctor work faster, but the doctor is
already working fast. He takes only 7.8 minutes for each patient. Alternative is to
increase the number of doctor, or try to change the arrival pattern of the patients,
or even change the service system itself. In queue analysis, the evaluations do not
give any solution but only describes the parameter of the system, so that the
management can evaluate different alternatives to find the best that suits their
purpose.
Discussion Questions
1. Describe the different symbols of Kendall’s notation.
2. During the height of the construction season in Rajshahi, trucks arrive at a
brick-field according to Poisson distribution at the rate of 26 trucks per hour.
The present capacity of the brick-field permits loading of 32 trucks per hour.
The service rate has exponential density function. Find
a) The average length of time a truck would be in the brick-field.
b) The proportion of time the brick-field is empty of trucks.
c) The probability of waiting more than 15 minutes.
d) The probability of finding more than 6 trucks in the brick-field.
e) If the service capacity decreases to 30 trucks per hour what would be
its effect on the average waiting time for each truck.
3. The manager of a neighborhood store is interested in providing good service
to the customers of his store. Presently, the store has a checkout counter for
the customers. On average, 30 customers arrive at the counter every hour,
according to Poisson distribution, and are served at an average rate of 35
customers per hour, with exponential service time. Find the following
averages:
a) Utilization of the checkout clerk.
b) Number of customers in the system.
c) Number of customers in line.
d) Time spent by the customer in store.
e) Waiting time in line.
4. A plant distributes its products by trucks. The average loading time is 20
minutes per truck. Trucks arrive at an average rate of two each hour.
Management feels that the existing loading facility is more than adequate.
However, the drivers complain that they have to wait too long. Analyze the
situation and find how much money the company can save by speeding up
loading if the waiting time of a truck is figured at Taka 250 per hour and the
plant operates eight hour each day.
Those who wrestle with waiting often contact someone like Richard Larson.
More and more researchers and consultants are studying lines and, in their efforts
to demystify and quantify them, have produced a mathematical discipline.
Queuing theory makes heavy use of probability theory and gets into abstruse
mathematical equations that gauge such things as how many people will arrive at
a drugstore to buy dental floss during the noon hour.
Ideas about lines matter to the people at Zayre, because they have tried to
differentiate their store from competitors I part by how swiftly they take
customers’ money. For years, Zayre has had a policy that if more than three
people are lined up at a checkout register, another register will open.
The system, Zayre admits, has its flaws. Lines do occasionally swell to four or
five customers when no one is free to handle another register. At times, every
register is open and yet the lines are four deep. “We found the system was
difficult to manage, because it was hard to predict when customers would arrive,:
said Frank Capek, Zayre’s manager of operations planning.
Years of listening to howling customers have also taught the airlines some
baggage-retrieval lessons. When American designed its baggage-claim area in
Dallas-Fort Worth Airport, it put it close to the gates, so disembarking passengers
would not have to trudge too far. But even though passengers reach the area
quickly, they must wait for their luggage. At Los Angeles International Airport,
passengers have to walk quite some distance to the claim area, but when they
arrive, their suitcases are usually there. Even though the Los Angeles travelers
spend more total time picking up their baggage, American has found they do not
grouse as much about baggage delays as do the Dallas passengers.
Few businesses have taken more hard shots about bad management of lines than
banks. “Our research indicates that people don’t like to spend time in bank
branches,” said David Mooney, senior vice president of Chemical Bank. “It’s
probably second in their disdain to waiting to see the dentist.”
To reduce lines, most banks have installed automatic teller machines and tried to
persuade employers to alter their check distribution or to directly deposit payroll
checks in the bank. The lines, however, persist.
One way to take some of the stings out of waiting is to entertain customers. Since
1959, the Manhattan Savings Bank has offered live entertainment during the
frenzied noontime hours. In 13 branches, a pianist performs and one branch has
an organ player (Willard Denton, the former Chemical chairman who dreamed up
the idea, liked organs, though present management thinks they are a trifle loud
for a bank). Occasionally, to make line-waiting even more wonderful, Manhattan
Savings has scheduled events such as a fancy-cat exhibit, a purebred dog show
and a boat show.
Because of all this, Manhattan Savings believes customers endure long waits
better than those who go to banks where the only music is the person in front of
you grinding his teeth. “At very hectic times, we get very few complaints,” said
Jean Madsen, a senior vice president.
At hotels and office buildings, mirrors affixed to elevator doors make people less
maniacal during waits. Instead of deciding whom to kill, they can comb their
hair. A study done by Russel Ackoff showed that hotels that had mirrors received
far less grumbling about elevator delays than ones without mirrors.
Just telling people how long they have to wait often cheers them up. Disneyland
is sensitive to waiting, since the line for a hot attraction like Star Tours can run to
1800 people. Like many amusement parks, Disney employs entertainment for
waiters, but it is also big on feedback. At various spots along lines, signs give
estimated delays from those points. Queuing experts say nothing is worse than
the blind waiting familiar to people at bus stops, who don’t know if the next bus
is one minute or 15 minutes away. Disney’s feedback permits parents to weigh
odd options: Is it wiser to wait 25 minutes fo rMr. Toad’s Wild Ride or 30
minutes for Dumbo?
pulling out their hair. “Like those flower peddlers outside tunnels and bridges,”
he said. “They are very shrewd.”
Case questions
1. What options might a chain store such as Zayre employ to increase
capacity? To influence demand?
2. What techniques can be employed to make a wait seem more pleasant
(besides the ones mentioned here)?
3. What products could be realistically merchandised?
Source: Excerpted from New York Times (Sunday, September 25, 1988)
Mentioned in the book “Service Operations Management” by Robert, G.
Murdick, Barry Render, and Roberta S. Russell, Prentice Hall, pages 344-345.