1. Career Point Cares
CAREER POINT UNIVERSITY
MAJOR ASSIGNMENT
TOPIC: Line Balancing
Submitted By :-
Mr. Wakil Kumar
UID : K12467
Course: B.Tech, 1st
year/
2nd
sem
Branch: CSE
Submitted To :-
Prof. Amardeep Kumar
Subject : Manufacturing (MEL120)
2. Career Point Cares
Contents
• The Line Balancing Problem
• Things to consider
• Terminology and Definitions
• Minimum Work Element
• Total Work Content
• Workstation Process time
• Cycle time
• Precedence Constraints
• Balance Delay
• Method – Largest Candidate Rule
3. Career Point Cares
The Line Balancing Problem
• The problem is to arrange the individual
processing and assembly tasks at the
workstations so that the total time required at
each workstation is approximately the same.
• Nearly impossible to reach perfect balance
4. Career Point Cares
Things to consider
• Sequence of tasks is restricted, there is a
required order
• Called precedence constraints
• There is a production rate needed, i.e. how
many products needed per time period
• Design the line to meet demand and within
constraints
5. Career Point Cares
Minimum Work Element
• Dividing the job into tasks of a rational
and smallest size
• Example: Drill a hole, can’t be divided
• Symbol – Time for element j:
• is a constant
ejT
ejT
7. Career Point Cares
Workstation Process time
• The amount of time for an individual
workstation, after individual tasks have been
combined into stations
• Sum of task times = sum of workstation times
8. Career Point Cares
Cycle time
• Time between parts coming off the line
• Ideally, the production rate, but may need to
be adjusted for efficiency and down time
• Established by the bottleneck station, that is
station with largest time
9. Career Point Cares
Precedence Constraints
• Generally given, determined by the required
order of operations
• Draw in a network style for understanding
• Cannot violate these, an element must be
complete before the next one is started
10. Career Point Cares
Balance Delay
• Measure of line
inefficiency due to
imbalances in
station times
c
wcc
nT
TnT
d
−
=
11. Career Point Cares
Method – Largest Candidate Rule
• List elements in descending order of T
• Assign elements to first station, from top to
bottom of list, minding constraints, and not
causing sum to exceed cycle time
• Continue assigning elements to stations
where each station < cycle time, largest
assigned first, until all assigned
• EXAMPLE