Lecture-16
Lecture-16
FLEXIBLE MANUFACTURING
SYSTEMS
BITS Pilani Girish Kant Garg
Department of Mechanical Engineering
Pilani Campus
1
Learning Objectives
2
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Manual Assembly Line
3
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Manual Assembly Line
4
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Manual Assembly Line
5
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Line Balancing
The process of equalizing the 𝐷𝑎
𝑅 𝑝=
amount of work at each 50 𝑆𝐻
workstation is called line
60 𝐸
balancing. 𝑇 𝑐=
Assembly-line balancing 𝑅𝑝
operates under two constraints:
• Precedence requirements
• Cycle time restrictions
Maximum amount of time the
Rp = Hourly production rate, units/hour
product is allowed to spend at each
Da = Annual demand, units/year
work station, if targeted production S = .Number of shifts/week
H = hours/shift
rate is to be achieved. E = Line efficency 6
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Line Balancing
𝑇 𝑤𝑐 𝑇 𝑤𝑐
𝑤= 𝐸 𝑏=
𝑇𝑐 𝑤 𝑇𝑠
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Example of Line Balancing
Problem
10
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Precedence Constraints
Precedence
diagram
11
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Solution
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Line Balancing Algorithms
14
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Largest Candidate Rule
Work elements are arranged in descending order according to
their Tek values.
1. Assign elements to the worker at the first workstation by
starting at the top of list and selecting the first element that
satisfies precedence requirements and does not cause the
total sum of Tek at that station to exceed the allowable Ts;
when an element is selected for assignment to the station,
start back at the top of the list for subsequent assignments.
2. When no more elements can be assigned without exceeding
Ts, then proceed to next station
3. Repeat steps 1 and 2 for as many additional stations as
necessary until all elements have been assigned.
15
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Example of Line Balancing
Problem
16
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Precedence Constraints
Precedence
diagram
17
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Largest Candidate Rule
18
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Largest Candidate Rule
19
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Largest Candidate Rule
Solution to line
balancing example:
(a) Assignment of work
elements
(b) Physical sequence
of stations with
assigned work
elements
20
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Kilbridge and Wester Method
Assignment of work elements to stations based on position in
the precedence diagram.
1. Work elements in the precedence diagram are arranged into
columns. The columns can then be organized into a list
according to their columns, with the elements in the first
column listed first.
2. Elements in a given column are presented in the order of their
Tek value; that is the largest candidate rule has been applied
in each column.
3. Once the list is established, the same three step procedure is
used as before.
21
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Precedence Constraints
Precedence
diagram
22
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Kilbridge and Wester Method
23
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Kilbridge and Wester Method
24
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Ranked Positional
Weights Method
1. A ranked positional value (RPW) is computed for each
element.
2. The RPW takes into account both the Tek value and its
position in the precedence diagram.
3. RPWk is calculated by summing Tek and all other times for
elements that follow Tek in the arrow chain of the precedence
diagram.
4. Elements are compiled into a list according to their RPW
value, and algorithm proceeds using the same three steps as
before.
25
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Precedence Constraints
Precedence
diagram
26
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Ranked Positional
Weights Method
27
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Ranked Positional
Weights Method
E= 4 / (5 X 0.92 )= 86.95 %
28
EA ZC412 / MM ZC412/DM ZC412, FMS, Lecture-16, 23/11/24 BITS Pilani, Pilani Campus
Thanks
29
BITS Pilani, Pilani Campus