Professional Documents
Culture Documents
OM - JJS - Ppt6a - Line Balancing
OM - JJS - Ppt6a - Line Balancing
J J SHRIKHANDE 1
J J SHRIKHANDE
2. Model line
2
J J SHRIKHANDE
3
J J SHRIKHANDE
Line Balancing
4
J J SHRIKHANDE
3 To determine number of
workstations.
5
J J SHRIKHANDE
6
J J SHRIKHANDE
Precedence Constraints:
*Technological sequencing requirements, the order in which
the work elements can be accomplished is limited.
Precedence Diagram:
*A graphical representation of the sequence of work
elements as defined by the precedence constraints.
Balance Delay (Balancing Loss):
*Balance delay is a measure of the line inefficiency which
results from idle time due to imperfect allocation of work
among station.
7
J J SHRIKHANDE
i) Precedence Constraint.
Products can’t move to other station if it doesn’t fulfill
required task at that station. It shouldn’t across other station
because certain part needs to be done before others.
ii) Cycle time Restriction
•Cycle time is maximum time for products spend in every
workstation.
• Different workstation has different cycle time.
8
Steps in Line Balancing
Specify the sequential relationships among tasks using a precedence diagram. The diagram consists of circles and arrows.
Circles represent individual tasks; arrows indicate the order of task performance.
Determine the required workstation cycle time (C), using the formula
C = Production Required perday / Required output per day (in units)
Determine the theoretical minimum number of workstations (Nt) required to satisfy the workstation cycle time
constraint using the formula (note that this must be rounded up to the next highest integer)
N = Sum of Task Time ( T ) / Cycle Time ( C )
Select a primary rule by which tasks are to be assigned to workstations and a secondary rule to break ties. For example,
the primary rule might be the longest task time, and the secondary rule, the task with the longest number of following
tasks. In this case, for the tasks that can be assigned, pick the one with the longest task time. If there is a tie, pick the
one that has the greatest number of following tasks.
Assign tasks, one at a time, to the first workstation until the sum of the task times is equal to the workstation cycle time
or no other tasks are feasible because of time or sequence restrictions. Every time a task is assigned, re-create the list
of tasks that are feasible to assign and then pick one based on the rule defined in 4. Repeat the pro- cess for
workstation 2, workstation 3, and so on, until all tasks are assigned.
Efficiency = Sum of Task Times ( T ) / Actual number of workstations ( Na ) × Workstation cycle time (C)
Here we assume there is one worker per workstation. When, for some reason, the number of workstations does not
equal the number of workers, we would usually substitute the number of workers for number of workstations since the
concern is normally related to the use of labor. Often, it is the case that the line is run at a cycle time different than the
time calculated in equation 8.1. In this case, the actual cycle time used by the assembly line should be used in the
efficiency calculation.
If efficiency is unsatisfactory, re-balance using a different decision rule. Keep in mind that the efficiency cannot be
improved if the current solution uses the theoretical number of workstations calculated in step 3.
Line - Balancing Process
Cycle
Thruput
Rate
/hr
Lead
Time
WIP
Units
Time
Process A B C D E 5 12 15 3
Case 1 15 Min 15 4 15 1
Case 3 5 Min
JIT Balanced
5 Min 5 Min 5 12 15 3
Little’s Law
WIP= Through-put Rate*Lead Time
J J SHRIKHANDE
Process A B C D E
Minutes/Unit 2 3 5 1 4
Capacity/hr 30 20 12 60 15
Option Case 1 Case 5 Case 5 B Case 6 Case 3
Manpower 1 5 5 6 3
J J SHRIKHANDE 11
5 B is Balanced Line 3 is Balanced JIT Line
J J SHRIKHANDE
Line Balancing
Line Balancing
12
Assembly Lines Balancing Concepts
Question:
Question:Suppose
Supposeyou
youload
loadwork
workinto
intothe
thethree
threework
work
stations
stationsbelow
belowsuch
suchthat
thateach
eachwill
willtake
takethe
thecorresponding
corresponding
number
numberof ofminutes
minutesas
asshown.
shown. What
Whatis isthe
thecycle
cycletime
timeof
of
this
thisline?
line?
J J SHRIKHANDE 14
Example of Line Balancing:
Structuring the Precedence Diagram
Task Predecessors Task Predecessors
A None E D
B A F E
C None G B
D A, C H E, G
A B G
H
C D E F
J J SHRIKHANDE 15
Example of Line Balancing: Precedence Diagram
Question:
Question:Which
Whichprocess
processstep
stepdefines
definesthe
themaximum
maximumrate
rateof
of
production?
production?
2 1 1
A B G 1.4
H
C D E F
3.25 1.2 .5 1
Answer:
Answer:Task
TaskCCisisthe
thecycle
cycle time
timeofof the
the line
line and
and
therefore,
therefore,the
the maximum
maximum rate
rate of
of production.
production.
J J SHRIKHANDE 16
Example of Line Balancing: Determine Cycle
Time
Question:
Question:Suppose
Supposewe
wewant
want to
toassemble
assemble100
100
fans
fansper
perday.
day. What
Whatwould
wouldour
ourcycle
cycletime
time
have
haveto
tobe?
be?
Answer:
Answer:
Production time per period
Required Cycle Time, C =
Required output per period
J J SHRIKHANDE 18
Example of Line Balancing:
Determine Theoretical Minimum Number of Workstations
Question:
Question:What
Whatisisthe
thetheoretical
theoreticalminimum
minimumnumber
numberof
of
workstations
workstationsfor
forthis
thisproblem?
problem?
J J SHRIKHANDE 19
J J SHRIKHANDE
20
Task Followers Time (Mins)
A 6 2
2 1 1
1.4 C 4 3.25
A B G
H D 3 1.2
B 2 1
C D E F
E 2 0.5
F 1 1
3.25 1.2 .5 1
G 1 1
H 0 1.4
J J SHRIKHANDE 21
Task Followers Time (Mins)
A 6 2
2 1 1
1.4 C 4 3.25
A B G
H D 3 1.2
B 2 1
C D E F
E 2 0.5
F 1 1
3.25 1.2 .5 1
G 1 1
H 0 1.4
A (4.2-2=2.2)
J J SHRIKHANDE 22
Task Followers Time (Mins)
A 6 2
2 1 1
1.4 C 4 3.25
A B G
H D 3 1.2
B 2 1
C D E F
E 2 0.5
F 1 1
3.25 1.2 .5 1
G 1 1
H 0 1.4
A (4.2-2=2.2)
B (2.2-1=1.2)
J J SHRIKHANDE 23
Task Followers Time (Mins)
A 6 2
2 1 1
1.4 C 4 3.25
A B G
H D 3 1.2
B 2 1
C D E F
E 2 0.5
F 1 1
3.25 1.2 .5 1
G 1 1
H 0 1.4
A (4.2-2=2.2)
B (2.2-1=1.2)
G (1.2-1= .2)
Idle= .2
J J SHRIKHANDE 24
Task Followers Time (Mins)
A 6 2
2 1 1
1.4 C 4 3.25
A B G
H D 3 1.2
B 2 1
C D E F
E 2 0.5
F 1 1
3.25 1.2 .5 1
G 1 1
H 0 1.4
A (4.2-2=2.2) C (4.2-3.25)=.95
B (2.2-1=1.2)
G (1.2-1= .2)
Idle= .2
J J SHRIKHANDE 25
Task Followers Time (Mins)
A 6 2
2 1 1
1.4 C 4 3.25
A B G
H D 3 1.2
B 2 1
C D E F
E 2 0.5
F 1 1
3.25 1.2 .5 1
G 1 1
H 0 1.4
A (4.2-2=2.2) C (4.2-3.25)=.95
B (2.2-1=1.2)
G (1.2-1= .2)
J J SHRIKHANDE 31
Assembly
Line
Balancing
J J SHRIKHANDE 32
Assembly
Line
Balancing
Contd.
J J SHRIKHANDE 33
Assembly
Line
Balancing
Contd.
J J SHRIKHANDE 34
Key Formulas
J J SHRIKHANDE 35
J J SHRIKHANDE
Flexible & U
Shaped Layouts
38
39
J J SHRIKHANDE
Bicycle Plant – Lean Layout – Cellular line
J J SHRIKHANDE 40
J J SHRIKHANDE
42
Push & Pull System
Push System Pull System
Service Factory
J J SHRIKHANDE 44