Scribd
Upload
19 views26 pages

Ims Mod3

Uploaded by

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

Ims Mod3

Uploaded by

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

Industrial Management

& Safety

Module 3
To study

• Project Management techniques


• Quantitative techniques
Project management techniques
Role of project management techniques :
 Project management is important because it ensures what is being
delivered, is right, and will deliver real value.
Network analysis:
 Network Analysis as the technique is used to solve projects like one
industrial, military etc. It is dividing complex job into small jobs and
represent graphically to easily analysis and solving it.
Project Management techniques
Critical Path Method:
 CPM Terms
• Activity: It is an individual operation which consumes resource and
time. It has beginning and end. An arrow ( ) represents an activity.
• Event: Event represent a point in time where completion of some
activity and beginning of new activity. A circle( ) represents a node.
• Successor event: An event which follows another event is called
successor event.
Project Management techniques
Critical Path Method:
 CPM Terms
• Predecessor event: The event which occurs before another event is
known as predecessor event.

• Dummy activity: A dummy activity which is not utilizing time or


resource. It is an imaginary activity represented by dotted arrow
line.
Project Management techniques
Critical Path Method:
 CPM Terms
• EFT (Earliest finish time): This is the earliest possible time at
which an activity can finish. This is represented on the top right
corner outside operation in a rectangle.
• LFT (Latest finish time): It is the total time by which and activity
should be completed. It is represented by triangle.
• Critical path: The path in which a LFT and EFT are equal is called
critical path. It can be represented by double line
• Slack or float: It is the difference between LFT and EFT. In critical
path slack or float will be zero.
Project Management techniques
Critical Path Method:
 Numbering an Event (Fulkersons rule)
1. Identify initial event and assign no 1
2. Number these initial events from 2,3,4 etc.
3. Mark the arrow direction
4. Follow the procedure till end
Project Management techniques
Program Evaluation and Review Technique:
 PERT Terms
PERT requires three estimated activity times:
1. Optimistic time (a minimum time)
2. Most likely time (an average time)
3. Pessimistic time (a maximum time)
to = optimistic time
tm = most likely time
tp = pessimistic time
Project Management techniques
Program Evaluation and Review Technique:
 PERT Terms
Statically Expected time te = [to + 4tm + tp/6]

Standard deviation St= [tp - to/6]

Variance V = St 2 = [tp - to/6]2


Project Management techniques
CPM Vs PERT:
Project Management techniques
Applications of CPM and PERT:
 CPM application
1. Construction of civil and mechanical projects
2. Electrical and electronic product manufacturing and
assembling
3. Equipment maintenance
4. Setting up new industry
Project Management techniques
Applications of CPM and PERT:
 PERT Application
1. Research and development activity
2. Military operations
3. Design and development of new product.
4. Weather forecasting.
Quantitative techniques
Linear Programming Problem (LPP):
 Question
A candy manufacturer has 130 kg of chocolate-covered cherries and
170 kg of chocolate-covered mints in stock. He decides to sell them
in the form of two different mixtures. One mixture will contain half
cherries and half mints by weight and will sell for Rs 2.00 per kg.
The other mixture will contain one-third cherries and two-thirds
mints by weight and will sell for Rs 1.25 per kg. How many pounds
of each mixture should the candy manufacturer prepare in order to
maximize his sales revenue?
Quantitative techniques
Linear Programming Problem (LPP):
 Solution for forming LPP:
Let x be the number of pounds of A to be prepared and y the
number of pounds of B to be prepared.
Max Z= 2x+1.25y
Constraint of A
1/2 x+ 1/3 y ≤ 130
Constraint of B
1/2 x+ 2/3 y ≤ 170
Quantitative techniques
Linear Programming Problem (LPP):
 Solution for forming LPP:
LPP
Max Z= 2x+1.25y

Constraints
1/2 x+ 1/3 y ≤ 130
1/2 x+ 2/3 y ≤ 170

x ≥0 , y≥ 0
Quantitative techniques
Linear Programming Problem (LPP):
 Graphical solution
To get graphical solution of above problem
Max Z= 2x+1.25y

Constraints
1/2 x+ 1/3 y ≤ 130------1
1/2 x+ 2/3 y ≤ 170------2

Solution
Replace ≤ or ≥ with = in equations
1/2 x+ 1/3 y = 130------1
Quantitative techniques
Linear Programming Problem (LPP):
 Graphical solution
Put x=0 in eqn 1 x=0 then y= 390
Put y=0 in eqn 1 y=0 then x= 260

1/2 x+ 2/3 y = 170------2

Put x=0 in eqn 1 x=0 then y= 390


Put y=0 in eqn 1 y=0 then x= 260

Draw graph and find end points


Quantitative techniques
Linear Programming Problem (LPP):
 Graphical solution
Quantitative techniques
Linear Programming Problem (LPP):
 Graphical solution
Substitute the end points in max z
Extreme point Value of z=2x+1.25y
(0, 0) 0
(0, 255) 318.75
(180, 120) 510.00
(260, 0) 520.00
The table shows that the largest value for z is 520.00 and the
corresponding optimal solution is (260, 0). Thus the candy manufacturer
attains maximum sales of $520 when he produces 260 pounds of mixture A
and none of mixture B.
Quantitative techniques
Transportation problem:
Quantitative techniques
Transportation problem:
Quantitative techniques
Transportation problem:
Quantitative techniques
Transportation problem:
Quantitative techniques
Game theory:
 Game theory is used for decision making under conflicting situations
ie where there are one or more opponents. In game theory it’s called
players.
 Example: Election success of one person will lead failure of other.

 Min and min-max principle: Min and min-max principle can be used
for the selection of optimal strategy by the two players.

 Saddle point: Saddle point is position of such an element in the payoff


matrix which is the minimum in its row and max in its column.
Quantitative techniques
Game theory:
 Problem to find value of game:

You might also like