BAF 204 Decision Making Techniques
BAF 204 Decision Making Techniques
BAF 204 Decision Making Techniques
The Decision Making Techniques Module has been produced by National Institute of Public
Administration (NIPA). All modules produced by the Institute are structured in the same way,
as outlined below.
We strongly recommend that you read the overview carefully before starting your
study.
For those interested in learning more on this subject, we provide you with a list of additional
resources at the end of this module; these may be books, articles or web sites.
Your constructive feedback will help us to improve and enhance this course.
Formal study time required is 4 weeks before the beginning of the semester
Time Frame
http://www.how-to-study.com/
The “How to study” web site is dedicated to study skills resources. You will find
links to study preparation (a list of nine essentials for a good study place), taking
notes, strategies for reading text books, using reference sources, test anxiety.
http://www.ucc.vt.edu/stdysk/stdyhlp.html
This is the web site of the Virginia Tech, Division of Student Affairs. You will find
links to time scheduling (including a “where does time go?” link), a study skill
checklist, basic concentration techniques, control of the study environment, note
taking, how to read essays for analysis, memory skills (“remembering”).
http://www.howtostudy.org/resources.php
Another “How to study” web site with useful links to time management, efficient
reading, questioning/listening/observing skills, getting the most out of doing (“hands-
on” learning), memory building, tips for staying motivated, developing a learning
plan.
The above links are our suggestions to start you on your way. At the time of writing
these web links were active. If you want to look for more go to www.google.com and
type “self-study basics”, “self-study tips”, “self-study skills” or similar.
www.nipa.ac.zm
NIPA-Main Campus – Outreach Programmes Division
Phone Numbers:+260-211-222480
Fax:
e-mail address:opd@nipa.ac.zm
The teaching assistant for routine enquiries can be located from the Outreach Division
from 08:00 to 17:00 or can be contacted on the numbers and email address indicated
above.
Library
There is a library located at the main campus along Dunshabe Road. The library
opens Monday to Friday from 08:00 to 17:00.
Assessments There shall be a minimum of two (02) assessments given to the students undertaking
this subject
These assessments shall be teacher marked assessments.
The assessments shall be determined and given by the course tutors after you have
covered a number of topics
The teacher/tutor shall ensure that the assessments are marked and dispatched to the
student.
A complete icon set is shown below. We suggest that you familiarize yourself with the icons
and their meaning before starting your study.
Note that units are not all the same length, so make sure you plan and pace your work to give
yourself time to complete all of them.
We recommend you write your answers in your learning journal and keep it with your study
materials as a record of your work. You can refer to it whenever you need to remind yourself
of what you have done.
Unit summary
At the end of each unit there is a list of the main points. Use it to help you review your
learning. Go back if you think you have not covered something properly.
However, there are also challenges. Learning at a distance from your learning institution
requires discipline and motivation. Here are some tips for studying at a distance.
1. Plan – Give priority to study sessions with your tutor and make sure you allow enough
travel time to your meeting place. Make a study schedule and try to stick to it. Set specific
days and times each week for study and keep them free of other activities. Make a note of the
dates that your assessment pieces are due and plan for extra study time around those dates.
2. Manage your time – Set aside a reasonable amount of time each week for your study
programme – but don’t be too ambitious or you won’t be able to keep up the pace. Work in
productive blocks of time and include regular rests.
3. Be organized – Have your study materials organized in one place and keep your notes
clearly labeled and sorted. Work through the topics in your study guide systematically and
seek help for difficulties straight away. Never leave this until later.
4. Find a good place to study – Most people need order and quiet to study effectively, so try
to find a suitable place to do your work – preferably somewhere where you can leave your
study materials ready until next time.
5. Ask for help if you need it – This is the most vital part of studying at a distance. No
matter what the difficulty is, seek help from your tutor or fellow students straight away.
6. Don’t give up – If you miss deadlines for assessments, speak to your tutor – together you
can work out what to do. Talking to other students can also make a difference to your study
progress. Seeking help when you need it is a key way of making sure you complete your
studies – so don’t give up.
Cost-benefit analysis: This a relatively simple technique where the value of the benefits of a
course of action and the costs associated with it are estimated. Costs are either one-off or
maybe ongoing. Benefits are most often received over a period of time. The cost and benefits
are compared and a decision is made on the basis of the expected net benefit.
Grid analysis: decision matrices analysis
This is a technique that helps a decision maker to choose between alternative options. It relies
on judgment and opinion. Although some mathematics are involved, it is not really a
mathematical model for decision-making.
The technique involves identifying the factors that matter to the decision-maker when
choosing between different alternatives, and giving each factor a weighting. Each alternative
is then given a score for each factor and this is multiplied by the weighting for the factor. The
weighted scores for all the factors are added and the alternative with the highest weighted
score is selected.
Learning Outcomes
Scatter diagrams
Selling
costs,
Sales
Volume
Independent and dependent variables
When we draw a scatter diagram, we often assume that the value of one of the variables
depends on the value of the other. For example, in the diagram above, we assume that the
amount of selling costs depends on the volume of sales. Selling costs are the dependent
variable in this example, and sales volume is the independent variable.
The independent variable (the cause) is plotted on the horizontal (x) axis
The dependent variable (the effect) is plotted on the vertical (y) axis.
The diagram suggests there is some correlation between selling costs and sales volume.
Degrees of correlation
Two variable might be perfectly correlated, partly correlated or uncorrelated. Correlation can
be positive or negative.
These differing degrees of correlation can be illustrated by scatter diagrams.
Perfect correlation
(a) Y (b) Y
X X
(c) Y (d) Y
X X
In (c) although there is no exact relationship, low values of X tend to be associated with low
values of Y, and high values of X with high values of Y.
In (d) again, there is no exact relationship, but low values of X tend to be associated with high
values of Y and vice versa
No correlation
The values of these two variables are not correlated with each other.
Positive and negative correlation
Correlation whether perfect or partial, can be positive or negative.
Positive correlation means that low values of one variable are associated with low values of
the other, and high values of one variable are associated with high values of the other.
Negative correlation means that low values of one variable are associated with high values of
the other, and high values of one variable with low values of the other.
Where x and y represent pairs of data for the two variables x and y, n = the number of pairs of
data used in the analysis.
r must always fall between -1 and +1.
r = +1 (means variables are perfectly positively correlated)
r = -1 (means variables are perfectly negatively correlated)
r = o (means variables are uncorrelated)
CLASS EXERCISE: The cost of output at a factory is thought to depend on the number of
units produced. Data have been collected for the number of units produced each month in the
last six months, and the associated costs.
Month Output(‘000s of units) Cost (K million)
X Y
1 2 9
2 3 11
3 1 7
4 4 13
5 3 11
6 5 15
Required: Assess whether there is any correlation between output and cost.
The coefficient of rank correlation can be interpreted in exactly the same way as the ordinary
correlation coefficient. Its values can range from -1 to +1.
Assess whether the position of the students in statistics correlates with their position in
economics
Linear regression analysis.
Correlation enables us to determine the strength of any relationship between two variables but
it does not offer us any method of forecasting values for one variable, y given values of
another variable, x.
Linear regression analysis (the least squares method) is one techniques for estimating a line of
best fit, once an equation for a line of best fit has been determined, forecasts can be made.
The least squares method is a very common method of estimating a line of best fit because it
does not rely on judgement to make the estimate.
The least squares method of linear regression analysis involves using the following formulae
to find a and b in Y= a + bX
(a) Use linear regression analysis to estimate the relationship between output volume and
costs
(b) Find the cost of producing 22,000 units of output
(c) Calculate the degree of correlation between output and costs by calculating the
correlation coefficient.
There are four components of a time series: trend, seasonal variations, cyclical variations and
random variations.
The trend
The trend is the underlying long-term movement over time in the values of the data recorded.
Preparing time series graphs and identifying trends
Year Output per labor hour Cost per unit (K) Number of employees
(units)
2001 30 1.00 100
2002 24 1.08 103
2003 26 1.20 96
2004 22 1.15 102
2005 21 1.18 103
2006 17 1.25 98
(A) (B) (C)
(a) In time series (A) there is a downward trend in the output per labour hour. Output per
labour hour did not fall every year, because it went up between 2002 and 2003, but the
long term movement is clearly a downward one.
(C) In time series (C) there is no clear movement up or down, and the number of
employees remained fairly constant around 100. The trend line is therefore a static, or
level one.
Seasonal variations
Seasonal variations are short-term fluctuations in recorded values, due to different
circumstances which affect results at different times of the year, on different days of the week
or at different times of day etc.
Cyclical variations
Cyclical variations are medium-term changes in results caused by circumstances which repeat
in cycles.
In business, cyclical variations are commonly associated with economic cycles, successive
booms and slumps in the economy. Economic cycles may last a few years. Cyclical variations
are longer term than seasonal variations.
Though you should be aware of the cyclical component, you will not be expected to carry
out any calculation connected with isolating it in this course. The mathematical models
which we will use, therefore exclude any reference to cyclical variations.
Required: Take a moving average of the annual sales over a period of three years.
Solution:
Year Sales Units Moving total of 3 Moving average of
years sales 3 years sales
2000 390
2001 380 1230 410
2002 460 1290 430
2003 450 1380 460
2004 470 1360 453
2005 440 1410 470
2006 500
The average would relate to the mid-point of the period, between summer and autumn. The
trend line average figures need to relate to a particular time period: otherwise, seasonal
variations cannot be calculated. To overcome this difficulty, we take a moving average of the
moving average. An example will illustrate this technique.
EXAMPLE
Moving averages of an even number of results
Year Quarter Volume of sales( ‘000 units)
2005 1 600
2 840
3 420
4 720
2006 1 640
2 860
3 420
4 740
2007 1 670
2 900
3 430
4 760
2 840
2580 654
3 420 650
2620 655
4 720 657.50
2640 660
2006 1 640 660
2640 660
2 860 662.50
2660 665
3 420 668.75
2690 672.5
4 740 677.50
2730 682.5
2007 1 670 683.75
2740 685
2 900 687.50
2760 690
3 430
4 760
Find the seasonal variation for each of the 15 days, and the average seasonal variation or each
day of the week using the moving averages method (take a five-day period)
Finding the seasonal component using the multiplicative model
The method of estimating the seasonal variations in the additive model is to use the
differences between the trend and actual data. The additive model assumes that the
components of the series are independent of each other, an increasing trend not affecting the
seasonal variations for example. The alternative is to use the multiplicative model whereby
each actual figure is expressed as a proportion of the trend. Sometimes this method is called
the proportional model.
When to use the multiplicative model
The multiplicative model is better than the additive model for forecasting when the trend is
increasing or decreasing over time. In such circumstances, seasonal variations are likely to be
increasing or decreasing too. The additive model simply adds absolute and unchanging
seasonal variations to the trend figures whereas the multiplicative model, by multiplying
increasing or decreasing trend values by constant seasonal variation factor, takes account of
changing seasonal variations.
Summary
Step 1: calculate the moving total for an appropriate period.
Step 2: calculate the moving average (trend) for the period. (calculate the mid-point of two
moving averages if there are an even number of periods
Step 3: calculate the seasonal variation. For an additive model, this is Y – T. For a
multiplicative model, this is Y/T
Step 4: calculate an average of the seasonal variations
Step 5: Adjust the average seasonal variations so that they add up to zero for an additive
model. When using the multiplicative model, the average seasonal variations should add up to
an average of 1.
A furniture dealer deals in only two items–tables and chairs. He has K 50,000 to invest and
has storage space of at most 60 pieces. A table costs K2500 and a chair K500. He estimates
that from the sale of one table, he can make a profit of K250 and that from the sale of one
chair a profit of K75. He wants to know how many tables and chairs he should buy from the
available money so as to maximise his total profit, assuming that he can sell all the items
which he buys.
Such type of problems which seek to maximise (or, minimise) profit (or, cost) form a general
class of problems called optimisation problems. Thus, an optimization problem may involve
finding maximum profit, minimum cost, or minimum use of resources etc.
(i) The dealer can invest his money in buying tables or chairs or combination thereof. Further
he would earn different profits by following different investment strategies.
The dealer is constrained by the maximum amount he can invest (Here it is K50,000) and by
the maximum number of items he can store (Here it is 60).
Stated mathematically,
2500x + 500y ≤ 50000 (investment constraint)
or 5x + y ≤ 100 …(3)
and x + y ≤ 60 (storage constraint) …(4)
The dealer wants to invest in such a way so as to maximise his profit, say, Z which stated as a
function of x and y is given by:
Z = 250x + 75y (called objective function) …(5)
Thus, a Linear Programming Problem is one that is concerned with finding the optimal value
(maximum or minimum value) of a linear function (called objective function) of several
variables (say x and y), subject to the conditions that the variables are non-negative and
satisfy a set of linear inequalities (called linear constraints).
The term linear implies that all the mathematical relations used in the problem are linear
relations while the term programming refers to the method of determining a particular
programme or plan of action.
Before we proceed further, we now formally define some terms (which have been used above)
which we shall be using in the linear programming problems:
Objective function Linear function Z = ax + by, where a, b are constants, which has to be
maximised or minimized is called a linear objective function.
In the above example, Z = 250x + 75y is a linear objective function. Variables x and y are
called decision variables.
The graph of this system (shaded region) consists of the points common to all half planes
determined by the inequalities (1) to (4). Each point in this region represents a feasible choice
open to the dealer for investing in tables and chairs. The region, therefore, is called the
feasible region for the problem. Every point of this region is called a feasible solution to the
problem. Thus, we have,
Feasible region: The common region determined by all the constraints including non-
negative constraints x, y ≥ 0 of a linear programming problem is called the feasible region (or
solution region) for the problem. In the figure above, the region OABC (shaded) is the
Feasible solutions: Points within and on the boundary of the feasible region represent
solutions of the constraints. In the diagram, every point within and on the boundary of the
feasible region OABC represents feasible solution to the problem. For example, the point (10,
50) is a feasible solution of the problem and so are the points (0, 60), (20, 0) etc. Any point
outside the feasible region is called an infeasible solution. For example, the point (25, 40) is
an infeasible solution of the problem.
Optimal (feasible) solution: Any point in the feasible region that gives the optimal value
(maximum or minimum) of the objective function is called an optimal solution. Now, we see
that every point in the feasible region OABC satisfies all the constraints as given in (1) to (4),
and since there are infinitely many points, it is not evident how we should go about finding a
point that gives a maximum value of the objective function Z = 250x + 75y.
To handle this situation, we use the following theorems which are fundamental in solving
linear programming problems.
Theorem 1 Let R be the feasible region (convex polygon) for a linear programming problem
and let Z = ax + by be the objective function. When Z has an optimal value (maximum or
minimum), where the variables x and y are subject to constraints described by linear
inequalities, this optimal value must occur at a corner point* (vertex) of the feasible region (A
corner point of a feasible region is a point in the region which is the intersection of two
boundary lines.)
Theorem 2: Let R be the feasible region for a linear programming problem, and let Z = ax +
by be the objective function. If R is bounded**, then the objective function Z has both a
maximum and a minimum value on R and each of these occurs at a corner point (vertex) of
R. (A feasible region of a system of linear inequalities is said to be bounded if it can be
enclosed within a circle. Otherwise, it is called unbounded. Unbounded means that the
feasible region does extend indefinitely in any direction.)
We observe that the maximum profit to the dealer results from the investment strategy (10,
50), i.e. buying 10 tables and 50 chairs.
This method of solving linear programming problem is referred as Corner Point Method.
1. Find the feasible region of the linear programming problem and determine its
corner points (vertices) either by inspection or by solving the two equations of
the lines intersecting at that point. In our example points OCA were found by inspection while
point B was found by solving for the point where the two equations intersect 5x + y = 100 (1)
and x + y = 60 (2)
Many of the problems in decision sciences are solved by standard mathematical tools. But
application of these mathematical models is based on certain assumptions. In real business
scenario at times it becomes quite difficult to satisfy these assumptions. Under these
circumstances managers use the technique of simulation. It is a very popular technique.
Simulation means imitation. In simulation, a given system is copied and artificial environment
is created to examine the behaviour of the system under specified conditions. It is a
descriptive and not an optimizing technique. It does not generate solutions but enables
managers to test their alternative solutions on a model that is an imitation of the original
situation. Where optimization models cannot be easily applied because of non-fulfillment of
assumptions, cost or other practical difficulties; simulation models offer a convenient,
inexpensive and quick way to evaluate alternative systems.
The technique of simulation has very extensive areas of application. It is used to train
managers to handle real life business challenges and solve very complex business problems.
Through simulation, business engineers are taught to evaluate aerodynamic properties of
aeroplanes by placing their models in wind tunnels where air is blown to examine its impact
on the model. “Decision simulators” have been developed and are in use in the corporate
world through which managers test various alternative decisions and their impact on corporate
profitability. Another field where simulation is widely applied is designing. Alternative
system designs are developed and evaluated to measure system performance. Some of the
well-known areas of simulation application are waiting lines, production designing, capacity
planning, manpower and machine scheduling, location, layout and typically complex
problems of inventory and maintenance.
Process of simulation
The process of simulation involves the following steps:
1. Definition of the problem: For simulating a problem it must be well defined, its
purpose and objectives should be clearly specified. The objectives, controllable and
uncontrollable variables should also be defined. For example a wholesaler in apples
wishes to maximize his revenues by a simulation model. His objective is maximization
of revenue, controllable variable is quantity of apples procured and uncontrollable
variable is market demand for apples. In the absence of clarity of objective, the cost
and efforts put in developing a simulation model will be wasted.
1. These days many computer software packages are available. Their application has
made simulation very easy and simple.
2. It is capable of analyzing large and complex real-world situations that cannot be done
through other quantitative models.
3. Simulation answers what if questions. Managers would like to know in advance what
options are available and which one is better.
4. Simulation does not disrupt the real system because simulation experiments are
undertaken with the model and not on the system.
5. “Time compression” is possible with simulation. Years of experience, say in the field
of advertising, in the real system can be compressed into minutes or seconds.
2. Simulation is based on trial and error approach hence unable to provide optimal
solutions as one can obtain from linear programming. Moreover, it produces different
solutions in repeated runs.
4. Simulation models are not standardized. For every situation the model is unique.
Therefore, different individuals may develop different models for the same situation.
Inventory Management
Organizations face vast challenges in procurement and management of large number of items.
Questions of order size, safety stock, storage and in process inventory need to be answered.
Since the available inventory models assume constant demand but in practice it varies from
time to time; under such a situation the established inventory models are unable to solve
inventory problems but simulation is capable of solving such problems. Further, when
companies wish to use JIT inventory model, simulation can guide them about its benefits
without disrupting the current inventory practices.
Logistics
As logistics problems involve a large number of random variables, such as distance, suitable
mode of transportation under different circumstances and their costs, delivery schedule;
simulation can be used to tackle these complex problems and suggest suitable solution under
different situations. It is also used to handle complex problems of the combination of different
modes of transportation such as road and rail or shipping and road.
Public Services
Public services include water supply, fire fighting operations, medical facilities, public
transport system and law and order machinery. The size of these services is enormous and
their operations are complex. Because of their complexity and involvement of a large number
of random variables no other technique is found suitable except simulation.
Management of Environment
Civil society and governments have shown a great concern towards environment in the recent
years. Some of the plants needing environmental clearance in India are power plants, huge
steel plants, mining projects, nuclear power plants, waste disposal systems. Often permission
is not granted for many industries and plants without evaluating their impact on environment.
Simulation models have been developed to determine the impact of such a variety of large
projects on environment.
To understand the various steps of Monte Carlo simulation model, let us take an example. A
motor-cycle dealer wishes to simulate demand for motor-cycles for 10 days. He has the
following data:
Ten random numbers are: 09, 52, 71, 38, 69, 80, 92, 44, 67, 47.
1. Decide random variables. If the firm wishes to develop a simulation model for the sale
of motor-cycles, daily demand of the number of motor cycles (in the range of 0 to 6)
may be considered a random variable and denoted by x. Price may be considered
another random variable denoted by y.
2. Build a probability distribution for each random variable decided in step 1. On the
basis of actual sales of last 20 days’ demand frequency is noted and from this
frequency distribution, a probability distribution [P(x)] of demand can be developed.
3. Generate random numbers. Random numbers are such numbers each of which has
equal chance of selection at random. Instead of generating random numbers
personally, managers select them from the table of random numbers that are
conveniently available in computer software/books. Random numbers represent
random variables.
4. Establish an interval of random numbers for each variable. For creating this interval
cumulative probability distribution is computed. If the cumulative probability for zero
demand is 0.05, its range of random number will be 00 – 04; for cumulative
probability of 0.30, its range of random number will be 05 – 29 and so on.
25
=2. 5
Average of daily demand = 10
If the manager so wishes he can undertake another trial run by selecting a new set of
ten random numbers, either using the old probability distribution or building a new
probability distribution on the basis of the first run.
EXERCISES
Q. 1 Explain the Monte Carlo Technique of simulation and how random variables are used
in a Monte Carlo process.
Example
Frontier bakery keeps stock of a popular brand of cake. Daily demand based on past
experience is as given below:
Daily 0 15 25 35 45 50
demand
Probability 0.01 0.15 0.20 0.50 0.12 0.02
Consider the following sequence of random numbers: 48, 78, 09, 51, 56, 77, 15, 14, 68, 09.
Using the sequence, simulate the demand for next 10 days.
Solution:
The given random number 48 corresponds to 36-85 matching the demand for 35 cakes.
The assignment model is a special form of a linear programming model. In the assignment
model, the supply at each source and the demand at each destination are each limited to one
unit. The following example from the text will be used to demonstrate the assignment model
and its special solution method. The Football Association of Zambia (FAZ) has four football
games on a particular match day. The Association wants to assign a team team of officials to
the four games in a way that will minimize the total distance traveled by the officials. The
distances in Kilometers for each team of officials to each game location are shown in the table
below:
Table 1
Game site
Officials Ndola Lusaka Solwezi Kitwe
A 210 90 180 160
B 100 70 130 200
C 175 105 140 170
D 80 65 105 120
The supply is always one team of officials, and the demand is for only one team of officials at
each game. The table is in the proper form for the assignment. The first step in the assignment
method of solution is to develop an opportunity cost table. We accomplish this by first
subtracting the minimum value in each row from every value in the row. These computations
are referred to as row reductions. In other words, the best course of action is determined for
each row, and the penalty or “lost opportunity” is developed for all other row values. The row
reductions for this example are shown in the table below.
Next, the minimum value in each column is subtracted from all column values. These
computations are called column reductions and are shown in the table below. It represents the
completed opportunity cost table for our example. Assignments can be made in this table
wherever a zero is present. For example, team A can be assigned to Lusaka. An optimal
solution results when each of the four teams can be uniquely assigned to a different game.
Game site
Officials Ndola Lusaka Solwezi Kitwe
A 105 0 55 15
B 15 0 25 75
C 55 0 0 10
D 0 0 5 0
Notice in the table above that the assignment of team A to Lusaka means that no other team
can be assigned to that game. Once this assignment is made, the zero in row B is infeasible,
which indicates that there is not a unique optimal assignment for team B. Therefore, the table
above does not contain an optimal solution. A test to determine if four unique assignments
exist in the table is to draw the minimum number of horizontal or vertical lines necessary to
cross out all zeros through the rows and columns of the table. For example, the table below
shows that three lines are required to cross out all zeros.
The three lines indicate that there are only three unique assignments, whereas four are
required for an optimal solution. (Note that even if the three lines could have been drawn
differently, the subsequent solution method would not be affected.) Next, subtract the
minimum value that is not crossed out from all other values not crossed out. Then add this
minimum value to those cells where two lines intersect. The minimum value not crossed out
in the table above is 15. The second iteration for this model with the appropriate changes is
shown below.
Game site
Officials Ndola Lusaka Solwezi Kitwe
A 90 0 40 0
B 0 0 10 60
C 55 15 0 10
D 0 15 5 0
No matter how the lines are drawn in the table above, at least four are required to cross out all
the zeros. This indicates that four unique assignments can be made and that an optimal
solution has been reached. Now let us make the assignments from the table above. First, team
A can be assigned to either the Lusaka or Kitwe game. We will assign team A to Lusaka first.
This means that team A cannot be assigned to any other game, and no other team can be
assigned to Lusaka. Therefore, row A and the Atlanta column can be eliminated. Next, team B
is assigned to Ndola. (Team B cannot be assigned to Lusaka, which has already been
eliminated.) The third assignment is of team C to the Solwezi game. This leaves team D for
Assignment Distance
Team A : Lusaka 90
Team B : Ndola 100
Team C : Solwezi 140
Team D : Kitwe 120
450 kilometres
Now let us go back and make the initial assignment of team A to Kitwe (the alternative
assignment we did not initially make). This will result in the following set of assignments.
Assignment Distance
Team B : Lusaka 70
Team D : Ndola 80
450 Kilometres
These two assignments represent multiple optimal solutions for our example problem. Both
assignments will result in the officials traveling a minimum total distance of 450 kilometres.
Features of queues
Queues form when customers want some kind of service, but find that the server is already
busy. Then they have the choice of either joining a queue and waiting to be served, or leaving
and possibly going to a competitor with a server who is not busy. Here we consider the
situation where they decide to join the queue. As you know, you are likely to meet a queue
whenever you buy a train ticket, get money from a bank, go to a supermarket, wait for traffic
lights to change and in many other circumstances.
However, not all queues involve people – for example, there are queues of programs waiting
to be processed on a computer, telephone calls waiting to use a satellite, items moving along
an assembly line, faulty equipment waiting to be repaired, ships queuing for a berth,
aeroplanes queuing to land and so on. By convention a ‘customer’ is anyone or anything
wanting a service, and a ‘server’ is the person or thing providing that service. Whatever
parties are involved; all queues have common features – the figure below shows a basic
queuing system.
customers may arrive singly or in batches – for example, when a bus-load of people
arrive at a restaurant
customers may form a single queue or a separate queue for each server
servers may be in parallel – where each does the same job – or in series – where each
gives part of the service and then passes the customer on to the next stage
customers may be served in order of arrival or in some other order – for example,
hospitals admit patients in order of urgency.
The quality of a service is judged – at least in part – by the time that customers have to wait.
You might assume any process in which customers have to wait a long time is inherently
inefficient – more efficient operations would have smoother flows of work and move
customers and servers quickly on to other tasks. Specifically, you know from experience that
to stand in a long queue of people is irritating (at best) and encourages customers to move to
other services and organizations. So an initial aim might be to have short waiting times.
However, there can be genuine reasons for having long queues – particularly when demand is
variable, service is restricted or organizations are trying to reduce the cost of servers. For
instance, you probably have to queue in morning rush-hour traffic (because of variable
demand on the road network), to wait for specialized medical treatment (because there is a
limited supply of servers) and at a supermarket checkout (because it is too expensive to
provide enough check-outs to eliminate queues).
Call centers, for example, try to reduce the time that callers wait by reducing the time servers
spend talking to each one. Usually, though, the easiest thing that managers can adjust is the
number of servers, and in any particular circumstances having a lot of servers gives the
shortest queues. Unfortunately, servers cost money and these short queues come with high
costs. So managers look for a balance that seems to satisfy all parties – combining reasonable
queue length with acceptable costs. The point of balance differs according to circumstances.
When you visit a doctor’s surgery you often have a long wait.
This is because the doctor’s time is considered expensive while patients’ time is cheap. To
make sure that doctors do not waste their valuable time waiting for patients, they make
appointments close together and patients are expected to wait. On the other hand, in petrol
stations the cost of servers (petrol pumps) is low and customers can nearly always drive to a
competitor when there is a queue. Then it is better to have a large number of servers with low
utilization, ensuring that customers only have a short wait in any queue.
Single-server queues
The simplest type of queue has:
a single server dealing with a queue of customers
Service time is also random – but now the data is continuous so we cannot use a discrete
Poisson distribution. Instead, we use a closely related continuous distribution called a negative
exponential distribution. It has the useful feature that the probability of service being
completed within some specified time, T, is:
And the probability that service is not completed by time T is 1 minus this, or:
When an average of 10 customers are served an hour the probability that service takes less
than 5 minutes is:
Now we have descriptions of the random arrival of customers in terms of λ (the mean arrival
rate) and of random service times in terms of μ (the mean service rate). If the mean arrival rate
National Institute of Public Administration- Outreach Programmes Division
is greater than the mean service rate, the queue will never settle down to a steady state but will
continue to grow indefinitely. So any analysis of queues must assume a steady state where μ is
greater than λ.
We can derive some standard results for a single-server queue – which are called the
operating characteristics.
Imagine a queue where the mean arrival rate is 2 customers an hour and the mean service rate
is 4 customers an hour. On average a customer arrives every 30 minutes, and takes 15 minutes
to serve, so the server is busy for half the time. Extending this reasoning, we can suggest that
a server is generally busy for a proportion of time λ / μ, and this is described as the utilization
factor. This is also the proportion of time that a customer is either being served or waiting –
technically described as being ‘in the system’. Looking at it in other ways, it is also the
probability that an arriving customer has to wait, and is the average number of customers
being served at any time.
utilization factor = λ / μ
The probability that there is no customer in the system is:
P0 = 1 − the probability there is a customer in the system
=1−λ/μ
This is the probability that a new customer is served without any wait.
The probability that there are n customers in the system is:
We can use this result – to calculate some other characteristics of the queue. To start with, the
average number of customers in the system is:
L=
The average number of customers in the queue is the average number in the system minus the
average number being served:
Wq
Learning Outcomes:
MRPII stands for Manufacturing Resource Planning and represents an extension of MRP.
MRPII points to computer based planning and scheduling designed to improve management’s
control of manufacturing and its support functions. MRPII maps an extension of MRP to
capture all manufacturing requirements including materials, human resources, scheduling, etc.
An MRP system is intended to simultaneously meet three objectives:
Ensure materials and products are available for production and delivery to customers.
Maintain the lowest possible level of inventory.
Plan manufacturing activities, delivery schedules and purchasing activities
The globalization of the economy and the liberalization of the trade markets have formulated
new conditions in the market place which are characterized by instability and intensive
competition in the business environment. Competition is continuously increasing with respect
to price, quality and selection, service and promptness of delivery. Removal of barriers,
international cooperation, technological innovations cause competition to intensify. In terms
of manufacturing emphasis is placed on reducing cost while improving quality. In addition,
other factors such as timely delivery of the product become critical (this is captured by
emphasis in Just in Time or JIT in short) techniques.
A key question to a MRP process is the number of times a company replenishes (or turns
around) inventory within a year. There are accounts of inventory annual turnover ratios of
greater than 100, mainly reported by Japanese companies. One can readily realize that a high
National Institute of Public Administration- Outreach Programmes Division
inventory ratio is likely to be conducive to lowering production cost since less capital is tied
up to unused inventory.
MRP systems use four pieces of information to determine what material should be ordered
and when:
the master production schedule, which describes when each product is scheduled to be
manufactured;
bill of materials, which lists exactly the parts or materials required to make each product;
production cycle times and material needs at each stage of the production cycle time; and,
Supplier lead times.
The master schedule and bill of materials indicate what materials should be ordered; the
master schedule, production cycle times and supplier lead times then jointly determine when
orders should be placed.
Bill of Materials gives information about the product structure, i.e., parts and raw material
units necessary to manufacture one unit of the product of interest.
MRP was pioneered in the 1970’s with the work of Orlicky. Later evolved or became part of
integrated to Manufacturing Resource Planning systems (or MRPII). MRPII is a computer
based planning and scheduling system designed to improve management’s control of
manufacturing and its support functions.
In today’s corporate environment MRPII is often termed as ERP (or Enterprise Resource
Planning).
MRPII represents a group of software programs designed to tie together disparate company
functions to create more efficient operations in areas such as assembly or delivery of products
or services.
Thus MRP has evolved to become a component of a MRPII system. Technically, MRPII
extends MRP and links it with the company’s information resources such as human resource
information system, financial management, accounting, sales, etc. Such extension is typical
according to modern trends in business management and modeling and made possible by
advances in information technology. On the other hand, the need to integrate is well
established in management thinking and practice. Since the pioneering work of Anthony
during the sixties, management decision-making processes are viewed from extending from
strategic planning, to management control and to operational control. MRP systems lay in-
between management control and operational control processes. However, as detailed
production data are linked with overall organizational information resources it becomes clear
that MRP and MRPII system implementations play a significant role in company’s corporate
advantage.
National Institute of Public Administration- Outreach Programmes Division
Problems with MRP systems:
The major problem with MRP systems is the integrity of the data. If there are any errors in the
inventory data, the bill of materials (commonly referred to as 'BOM’) data, or the master
production schedule, then the output data will also be incorrect.
Most vendors of this type of system recommend at least 99% data integrity for the system to
give useful results.
Another major problem with MRP systems is the requirement that the user specify how long it
will take a factory to make a product from its component parts (assuming they are all
available). Additionally, the system design also assumes that this "lead-time" in
manufacturing will be the same each time the item is made, without regard to quantity being
made, or other items being made simultaneously in the factory.
Inventory Management
A business can run smoothly its operating activities only when appropriate amount of
inventory is maintained. Inventory affects all operating activities like manufacturing,
warehousing, sales etc. The amount of opening inventory and closing inventory should be
sufficient enough so that the other business activities are not adversely affected. Thus,
inventory plays an important role in operations management.
Inventory is an asset that is owned by a business that has the express purpose of being sold to
a customer. Inventory refers to the stock pile of the product a firm is offering for sale and the
components that make up the product. In other words, the inventory is used to represent the
aggregate of those items of tangible assets which are –
Raw material and supplies: It refers to the unfinished items which go in the production
process.
Work in Progress: It refers to the semi-finished goods which are not 100% complete but
some work has been done on them.
Finished goods: It refers to the goods on which 100% work has been done and which are
ready for sale.
Inventory management is the practice overseeing and controlling of the ordering, storage and
use of components that a company uses in the production of the items it sells. A component of
supply chain management, inventory management supervises the flow of goods from
manufacturers to warehouses and from these facilities to point of sale. Inventory control
means efficient management of capital invested in raw materials and supplies, work- in –
progress and finished goods.
Inventory is considered to be one of the most important assets of a business. Its management
needs to be proactive, accurate and efficient. Inventory is essential for every organization to
ensure smooth running of the production process, to reduce the ordering cost of inventory, to
take advantage of quantity discount, avoid opportunity loss on sales, to utilize and optimize
the plant capacity and to reduce the overall price. Thus, it can be said that inventory is
inevitable and has to be maintained in appropriate quantity. However, the concept of Just In
Time (JIT) is becoming popular which is an inventory strategy companies employ to increase
efficiency and decrease waste by receiving goods only as they are needed in the production
process, thereby reducing inventory costs. This method requires producers to forecast demand
accurately.
B. Financial Objectives:
a. To minimize the capital investment in the inventory.
b. To minimize inventory costs.
c. Economy in purchase.
Learning Outcomes:
Exercise
In the accounting department of a company, 60 % of bookkeepers have been given formal
training in accountancy and 4% have not. Employees who have not been trained may make a
mistake, and it has been discovered that they make a mistake 50% of the time.
A supervisor checks work of an employee selected at random and finds that the task has been
performed correctly. What is the probability that the task was performed by an employee who
has not been trained?
Exercise
The following example is more complex.
Mopani and konkola copper mines have to be tested for the emission of pollutants. It is known
that 25% of all mines emit excessive pollutants. When tested, 99% of all copper mines that
emits excessive pollutants will fail the test, but 17% of the mines that do not emit excessive of
pollutants will also fail the test.
What is the probability that a mine that actually emits excessive amounts of pollutants?
Consider an experiment of tossing a coin 3 times. You will be able to write the sample space
and be able to write the probability of any interest of the required random variable, such as;
find the probability that exactly one head appears on the second toss. All you need to do is to
write the sample space and the event which will give you the required probability. Soppose
now that you are asked to toss a coin 20 times, and being asked to find the probability that at
least two heads. This method of writing the sample space becomes tedious and all we have to
do is use the binomial dsitribution where we need to know that the experiment has two
possible outcomes, a head called the ‘success’ or no head which is ‘failure’. So we define a
random variable x as the number of heads that can appear as ; X ={0,1,2,3,....,20} .
In genral, if a single trial can have only two possible mutually exclusive and exhaustive
results, either ‘success’ with the probabilty p or ‘failure’ with probability 1-p( = q), then in a
series of n trials, the probability of x successes is given by
p( x )=P ( X=x )= ( nx ) p (1− p) =(nx ) p q
x n− x x n− x
There are a fixed number of trials. Think of trials as repetitions of an experiment. The letter n
denotes the number of trials.
The n trials are independent and are repeated using identical conditions. Because the n trials
are independent, the outcome of one trial does not affect the outcome of any other trial.
Another way of saying this is that for each individual trial, the probability, p, of a success and
probability, q, of a failure remain the same. For example, randomly guessing at a true - false
statistics question has only two outcomes. If a success is guessing correctly, then a failure is
guessing incorrectly. Suppose Joe always guesses correctly on any statistics true - false
question with probability p=0.6. Then, q=0.4 .This means that for every true - false statistics
question Joe answers, his probability of success (p=0.6) and his probability of failure (q=0.4)
remain the same.
The outcomes of a binomial experiment fit a binomial probability distribution. The random
variable X= the number of successes obtained in the n independent trials.
The mean, μ, and variance, σ2, for the binomial probability distribution is μ=np and σ2=npq.
The standard deviation, σ, is then σ=\ npq .
Example 1
At ABC University, the withdrawal rate from an elementary physics course is 30% for any
given term. This implies that, for any given term, 70% of the students stay in the class for the
entire term. A "success" could be defined as an individual who withdrew. The random
variable is X = the number of students who withdraw from the elementary physics course per
term.
Example 2
Suppose you play a game that you can only either win or lose. The probability that you win
any game is 55% and the probability that you lose is 45%. If you play the game 20 times,
what is the probability that you win 15 of the 20 games? Here, if you define X = the number of
wins, then X takes on the values X = 0, 1, 2, 3, ..., 20. The probability of a success is p=0.55.
The probability of a failure is q=0.45. The number of trials is n=20. The probability question
can be stated mathematically as P(X =15), using the general model given above as:
p( x )=P ( X=x )= ()
n x
x
n
()
p (1− p) n− x= p x qn− x
x
Where p=0.55, q=0.45 , n = 20 and x= 15. You substitute these values in this model and your
answer is the required probability.
Example 3
A fair coin is flipped 15 times. What is the probability of getting more than 10 heads? Let X =
the number of heads in 15 flips of the fair coin. X takes on the values x = 0, 1, 2, 3, ..., 15.
Since the coin is fair, p = 0.5 and q = 0.5. The number of trials is n = 15. The probability
question can be stated mathematically as P(X >10) .
Example 4
Example 5
It has been stated that about 41% of adult workers have a high school diploma but do not
pursue any further education. If 20 adult workers are randomly selected, find the probability
that at most 12 of them have a high school diploma but do not pursue any further education.
How many adult workers do you expect to have a high school diploma but do not pursue any
further education?
Let X = the number of workers who have a high school diploma but do not pursue any further
education.
X takes on the values 0, 1, 2, ..., 20 where n = 20 and p = 0.41. q = 1 - 0.41 = 0.59. X ~
B(20,0.41)
Find P(X ≤12). P(X ≤12) =0.9738. (calculator or computer)
The result is P(X ≤12) =0.9738.
The probability at most 12 workers have a high school diploma but do not pursue any further
education is 0.9738
The graph of X ~ B(20,0.41) is:
The y-axis contains the probability of X, where X = the number of workers who have only a
high school diploma.
The number of adult workers that you expect to have a high school diploma but not pursue
any further education is the mean, μ = np
The formula for the variance is σ2=npq. The standard deviation is σ = √ npq
σ=√(20)(0.41)(0.59)=2.20 ..
Exercise
1. The probability that a person chosen at random is left handed is 0.1. What is the
probability that in a group of ten people there is one, and only one, who is left handed?
What is the most likely number of left handed people in a group of ten?
Poisson distribution
Consider the number of telephone calls arriving at a small telephone exchange in 100
consective time intervals of five minutes. What kind of distribution would we expect in this
situation? We may think that this is a binomial distribution, since the number of calls is a
discrete variable. However, a little further thought reveals certain problems, such as what
number corresponds to the binomial parameter n and what meaning can we give to p, the
probability of a “ success”, in this cas the occurance of a telephone call? In this particular
situation there is one statistic which we can calculate and this is the mean number of telephone
calls , m , for a five –minute time interval, for example;
Number of time fx
intervals, f
Number of
calls
0 71 0
1 23 23
2 4 8
3 2 6
4 or more 0 0
100 37
m=
∑ fx =37 =0 .37
Therefore, ∑ f 100
For this module we consider the discrete distribution , with m , the mean number of calls for a
five minutes time interval follows a poisson distribution which gives the probability of x
events occuring in a given interval as:
Exercise
1. The number of emergency admissions each day to a hospital is found to have a possion
distribution with mean 2.
(a) Evaluate the probability that on a particular day there will be no emergency
admissions.
(b) At the beginning of one day the hospital has five beds available for
emergencies. Calculate the probability that this will be an insufficient number for the day.
(c ) Calculate the probability that there will be exactly three admissions altogether
on two consective days.
For a continuous random variable X, with mean μ and standard deviation σ , the normal
distibution curve is given as the one given above. This curve has the following properties;
It is symmetrical about x= μ
It has one maximum at x= μ
As x →±∞ , f (x )→0
The area under the curve is 1.
Thus the Normal distribution may be a suitable model for a variate which is
Continuous
Unimodal
Has a symmetrical frequency distribution,
Has class frequencies which fall away rapidly as the variate moves away from the mean
2
A convenient way of denoting that X is Normally distributed with mean μ and variance σ
2
is N ( μ , σ ) . μ and σ are parameters of the distribution. Their values determine the shape
of the distribution.
Standardization
f(x) is a probability density function. It does not give the probability that X takes a certain
value but that X lies in a certain range: the probability X lies between x and x +δx is f ( x )δx .
x2
∫ f ( x )dx
The probability that X lies between x 1 and x 2 is thus given by x1
which is the area
under the curve shown below:
Therefore, the probability that a woman weighs between 61 and 65 kgs is 0.262.
(70−60)
x=70 , z= =2
(c ) 5
Therfore, p( z >2)=1− p( z <2)=0 .0228
Learning Outcomes:
NOTE: When constructing confidence intervals, the interval that is central, or symmetric,
about the mean is required, unless otherwise stated.
Example.
A machine produces steel sheets whose weights are known to be normally distributed with
a standard deviation of 2.4 kg. A random sample of 36 sheets had a mean weight of 31.4
kg. Find a 99% confidence interval for the population mean.
Solution
Let X be the random variable (r.v) ‘the weight, in kg, of a steel sheet’.
Example
A survey of 500 people shopping at a shopping mall, selected at random, showed that 350 of
them used credit cards for their purchases and 150 of them used cash.
(a) Construct a 95% confidence interval estimate of the population of all persons at the mall
who use credit card for shopping.
(b) What would our confidence level be, if we make the assertion that the proportion of
shoppers at the mall who shop with a credit card is between 67% and 73%?
Solution
(a) There are 350 out of a total sample of 500 who pay by credit card. Hence, the sample
proportion of credit card shoppers is:
Using the Standard normal table, we see that the area under the curve for Z = 1.5 is 0.4332.
This area is on each side of the mean so that the total area is 0.8664. In other words, our
confidence level is 86.64% that the population proportion of shoppers using credit card is
between 67% and 73%.
Recommended Readings
Main Text
Students can also refer to Morris, C (2008), Quantitative Approaches in Business Studies, 7th
edition, FT Prentice Hall,