Академический Документы
Профессиональный Документы
Культура Документы
Assignment Set -1
C1 C2 C3 C4 S
F1 350 2 7 6 0
F3 2 5 410 5 0
R 0 0 0 0
1. Identify the lowest cost cell in the entire transportation matrix and allocate
units as much as possible to this cell.
2. Eliminate the row or column in which either supply or demand is exhausted.
In case, the lowest cost cell is not unique, select the cell where the maximum
allocation can be made.
3. After adjusting the supply and demand for all uncrossed rows and columns,
repeat the procedure with the next lowest unit cost among the remaining rows
and columns of the transportation matrix. Then, allocate as much as possible to
this cell and eliminate the row and column in which either supply or demand is
exhausted.
4. Repeat the procedure until the entire supply at different sources is exhausted
to satisfy the demand at different warehouses.
Using matrix minimum method
C1 C2 C3 C4 S
F1 310 240 7 6 0
F2 725 5 220 315 0
F3 225 5 4 5 0
R 0 0 0 0
Assignment Set -2
Q4) The processing time of four jobs and five machines (in hours, when passing
is not allowed) is given in following table
a. Find an optimal sequence for the above sequencing problem.
b. Calculate minimum elapsed time & idle time for machines A, B, C, D& E.
Answer:
The necessary condition to be satisfied is either or both of the following.
Job Machines
A B C D E
1 0-8 8-12 12-16 16-19 19-27
The minimum elapsed time is 55 hours and the idle time for machines A, B, C,
D, E is 21, 33, 22, 35, and 31 hours respectively.
Q5) Define following criterias used for decision making under Uncertainty
a. Optimism (maximum or minimum) criterion
b. Pessimism (maximum or minimum) criterion
c. Equal probabilities (Laplace) criterion
d. Coefficient of optimism (Hurwitz) criterion
e. Regret (salvage) criterion
Answer:
a) Optimism (maximum or minimum) criterion -Here, the decision maker tries
to achieve the largest possible profit (maxima) or minimum possible cost
(minimum). If the entries in the payoff matrix are the one which the decision
marker wants as large as possible, for example, profits sales revenue, he/she
selects the alternative that represents the maximum of the maximum payoff.
In case where the entries of the payoff matrix are one which the decision
maker wants as small as possible, he/she goes for the minimum of the
minimum. Here, corresponding to the various alternatives, he/she locates the
maximum payoff for each alternative (in case of profit or revenues) and then
selects the alternative which gives the maximum of maxima.
b) Pessimism (maximum or Minimum) criterion - In the criterion, the decision
maker selects the alternative representing the maximum of the minimum
payoffs in case of profits. In the case of cost or loss, he/she selects the
minimum of the maxima.
c) Equal probabilities (Laplace) criterion - As the probabilities are unknown for
the states of nature, all are assigned equal probabilities. Since the states of
nature are mutually exclusive and collectively exhaustive, the probabilities
of each of these states equal one divided by the number of states of nature.
Expected value of the payoff is calculated and case of profit, the maximum
value of the expected payoff is chosen; whereas, in case of losses, the
minimum value of the payoff is chosen.
d) Coefficient of optimism (Hurwitz) criterion -Hurwitz introduced the idea of a
coefficient of optimism, denoted by , to measure the degree of optimism
for the decision maker. The coefficient takes a value between zero and one.
Here, zero represents a complete pessimistic attitude of the decision maker
about the future; whereas, one represents a complete optimistic attitude of
the decision maker towards the future. The criterion suggests that an
alternative that maximise x (maximum in the column)+ (1-) x (minimum
in the column) should be chosen.
e) Regret (salvage) criterion - This criterion is also known as the opportunity-
loss decision criterion or minima x regret decision criterion. This is because
the decision maker feels regret after adopting a wrong course of action
(alternative), which results in an opportunity loss of the payoff. The
decision maker therefore wants to minimise the regret. In order to develop
the opportunity loss table, perform the following steps:
Find the best payoff corresponding to each state of nature.
Subtract all other entries (payoff values) in that row from this value.
For each course of action (strategy or alternative), identify the worst or
maximum regret value .Record this number in a new row.
Select the course of action (alternative) with the smallest anticipated
opportunity loss value.
1. PERT -PERT is another model that is used for scheduling and analysing
different activities involved in a project. PERT was developed in 1957 by the
US Navy for planning and scheduling the Polaris nuclear submarine project.
It is used in projects where the time of completion is given priority by the
PERT model. The CPM model uses a single time estimate (when the time
estimate is certain) for each individual activity in the network. Through CPM
does not answer the variability in project duration, PERT model consider the
variability of the project duration? In the PERT model, variance or standard
deviation is used for measuring variability in the project duration. The
average squared difference of a set of numbers from their arithmetic average
is called the variance of the set of numbers.
2. CPM -CPM is one of the most popular and widely used project scheduling
models. This model was developed by Morgan R. Walker of DuPont, USA,
in 1957 to solve maintenance problems in chemical factories. These days,
CPM is used in almost all kinds of projects, including construction, software
development, research, product development, engineering, plant operation
and maintenance. The CPM technique involves the following steps to
schedule a project:
Developing the network diagram.
Estimating the activity duration.
Identifying the activities in the project.
Determining the dependency and sequence of the activities.
Calculating the earliest and latest start times of the activities.
Calculating the earliest and latest finish times of the activities.