Problem 1: Product Mix Problem

A company makes two products (X and Y) using two

machines: a Lathe and a Milling Machine. Each unit
of X that is produced requires 50 minutes processing
time on Lathe and 30 minutes processing time on
Milling machine. Each unit of Y that is produced
requires 24 minutes processing time on Lathe and 33
minutes processing time on Milling machine.
Available processing time on Lathe is forecast to be
40 hours and on Milling machine is forecast to be 35
hours. Company policy is to maximise the combined
sum of the units of X and the units of Y in stock at the
end of the week. Find out how many units of X and Y
to be produced if the profits on each of unit of X and
Y are Rs 30 and 20 respectively.
 Problem 1: Product Mix Problem
Machine A Machine B
(Total = 2400 min) (Total = 2100 min)
Product X (Profit = Rs 30) 50 min 30 min

Product Y (Profit = Rs 20) 24 min 33 min

Let one has to produce x units of X and y unit of Y for maximizing profit

Objective Function: Maximize 30x +20y

Constraint 1: 50x + 24y ≤ 2400
Constraint 2: 30x + 33y ≤ 2100
Constraint 3: x ≥ 0
Constraint 4: y ≥ 0
 Problem 1: Product Mix Problem
Linear Programming

50x+24y=2400

30x+33y=2100
30x+20y

(0, 0) x
 Problem 1: Product Mix Problem
Unit Processing Time
Profit A B C D E F G
Rs
1 32 12 56 23 23 22 90 56
2 47 34 23 45 19 45 71 67
3 31 26 22 55 34 76 53 71
4 52 5 68 11 41 12 23 27
5 61 56 34 62 22 42 33 49
6 45 12 22 98 19 10 71 20
7 10 45 34 11 80 20 12 14
Total Time 6700 1200 800 900 4500 1500 7200
 Problem 2: Knapsack Problem

n
Objective Function: Maximize p
i 1
i xi
n
Subject to w x
i 1
i i W
 Problem 2: Knapsack Problem
Part Time (min) Value (Rs)
1 110 7000
2 210 11000
3 150 12000
4 320 16000
5 280 10000
6 510 24000
7 390 17000
8 460 18000
Total Time = 16 hours
n
Objective Function: Maximize p
i 1
i xi
n
Subject to w xi 1
i i W
 Problem 3: Stock Cutting Problem
In a workshop raw material required is in the form of cylindrical pieces
which are to be cut from long cylindrical rods. Assume that these rods
come in the length of 1500 mm. A machinist requires following
cylindrical pieces, which are cut from rods.

853 mm, 612 mm, 507 mm, 437 mm, 433 mm, 319 mm, 310 mm,
291 mm, 220 mm, 186 mm, 167 mm, 160 mm

What should be the combination of these pieces cut from various rods
so that wastage is minimum.

853 612

507 437 433

319 310 291 220 186 167

160
 Problem 3: Stock Cutting Problem
In a workshop raw material required is in the form of cylindrical pieces
which are to be cut often cut from long cylindrical rods. Assume that
these rods come in the length of 1500 mm. A machinist requires
following cylindrical pieces, which are cut from rods.

853 mm, 612 mm, 507 mm, 437 mm, 433 mm, 319 mm, 310 mm,
291 mm, 220 mm, 186 mm, 167 mm, 160 mm
n
Objective Function: Maximize l
i 1
i xi
n
Subject to l
i 1
i xi  W
More Complex Problem
790 (25 no), 630 (20 no), 550 (35 no), 510 (5 no), 460 (15 no),
440 (60 no), 330 (15 no), 310 (25 no), 280 (8 no), 250 (42 no)
Problem 4: Stock Cutting Problem in 2D

area of rectangles
UR =
area of sheet
Problem 4: Stock Cutting Problem in 2D

area of rectangles
UR =
area of sheet
Problem 4: Stock Cutting Problem in 2D
Single Piece Nesting
Problem 5: Compact Packing Problem in 3D
 Problem 6: Traveling Salesman Problem
A number of holes have to be drilled in a plate. Following are
the locations where the holes have to be drilled. Do you suggest
any sequence in which the holes have to be drilled so that total
time required for drilling is minimized.

No of Solutions = 87178291200
 Problem 6: Traveling Salesman Problem
Soldering is to be carried out at large number of
locations in PCB. Following are the locations where
soldering is to be done. Do you suggest any sequence
in which soldering is to be carried out so that total
time required for soldering is minimized.
 Problem 7: Network Optimization
A large number of points in a plane/space have to be
connected by shortest distance.
Problem 7: Network Optimization Problem

Typical piping layout in a industrial Plant

Problem 7: Network Optimization Problem

A hydraulic manifold used in earth moving equipment

Problem 7: Network Optimization Problem

A hydraulic manifold used in earth moving equipment

Problem 8: Robot Path Optimization Problem

.In automated factories mobile robots are used to move machined

components from one machine to another. Let us say robot has to
travel from one machine to another in a shortest possible time
avoiding obstacles which come in its path. If obstacles can be
approximated as polygonal areas, what should be the path which
robot takes to reach from one machine to another.
Problem 8: Robot Path Optimization Problem

Simplification Real Life Situation

Moving object is a point Moving object is a geometric entity
Obstacles are polygons Obstacles are curved objects
Path Planning Motion Planning
Stationary obstacles Moving obstacles
2D 3D
Problem 8: Robot Path Optimization Problem
Robot Path Optimization
.
Problem 9 : Pocket Machining Problem
Problem 9 : Pocket Machining Problem
Problem 9 : Pocket Machining Problem
Problem 9 : Pocket Machining Problem
Problem 9 : Pocket Machining Problem
Problem 9 : Pocket Machining Problem
Problem 9 : Pocket Machining Problem
Problem 9 : Pocket Machining Problem
Problem 10: Job Shop Scheduling Problem
There are four parts (1, 2, 3, 4) to be produced in a workshop.
All the four parts require machining on four different
machines (A, B, C, D). The time required for machining each
part on different machines (in minutes) is given below.
Calculate total minimum time required to machine all
components.

1 2 3 4
A 50 40 30 20
B 25 75 25 60
C 65 10 40 10
D 5 55 55 15
Problem 10: Job Shop Scheduling Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 11: Clustering Problem
Problem 12: Assembly Sequence Planning

Hard Constraints
Precedence Constraints
Soft Constraints
 Problem 12: Assembly Sequence Planning
3
3 4 C E

A
5 1 2
B
2 D F
4
5
liaison
ABCDEF
: 720 sequences

1 D F D B EA

Hard Constraints: A before B, B before D, B before C

Soft Constraints: B before E, B before F
Problem 13: Shape Localization Problem
Problem 14: Optimum Orientation for
Layered Manufacturing
Problem 15: Moldability of Polyhedra
 Problem 15: Moldability of Polyhedra

In a casting process the shape of the mold is dependent on

the shape of the object that is to be cast. A variety of
solids can be cast using molds but one is interested in
objects that can be cast using only either a single mold or
two-piece mold. Taking an example of casting a sphere.
There does not exist a single mold from which a sphere
can be cast. If, however, it was permitted to use more
than just one mold, the sphere could be cast in two
halves. Thus there exist constraints that must be imposed
on any castable object.
Given a solid polyhedron, how can one evaluate if part
can be cast in single-piece mold, two-piece mold or
multi-piece mold
Problem 15: Moldability of Polyhedra
Problem 15: Moldability of Polyhedra
Problem 15: Moldability of Polyhedra
 Problem 16: Developability of Surfaces

A surface which can be flattened as sheet

without any deformation is defined as
developable surface.
Non developable surfaces
Applications: Sheet Metal Manufacturing
Garment & Shoe Manufacturing
Applications: Composites
Problem 16: Developability of Surfaces
Problem 16: Developability of Surfaces