Flow Line Balancing Problem & Extensions/ Enhancements
Flow Line Balancing Problem & Extensions/ Enhancements
Flow Line Balancing Problem & Extensions/ Enhancements
Extensions/ Enhancements
Components
Activity 1
Activity 2
Activity 3
13 min.
11 min.
8 min.
Finished Product
Worker 2
Worker 3
Activity time
13 min/unit
11 min/unit
8 min/unit
Capacity
1/13 unit/minutes
= 4.61 units/hr
1/11 units/minutes
= 5.45 units/hr
1/8 unit/minutes
= 7.5 units/hr
Process capacity
Flow rate
Cycle time
Idle time
16.8 minutes/unit
- 13 minutes/unit
= 3.8 minutes/unit
16.8 minutes/unit
- 11 minutes/unit
= 5.8 minutes/unit
16.8 minutes/unit
- 8 minutes/unit
= 8.8 minutes/unit
Utilization
Average Labor
Utilization
{Total = 18.4
min/unit}
p.62
p.63
De-bottlenecking through
Manual Line Balancing
p.64
Components
Activity 1
Activity 2
Activity 3
13 min.
11 min.
8 min.
Finished Product
p. 65
Revised calculations
Note that the original estimated times are now replaced
by actual detailed times.
Worker 1 time 792 seconds, i.e. 159.1 units/ week
(35*60*60/792)
Worker 2 utilization 648/792 = 81.8%
Worker 3 utilization 450/792 = 56.8%
Overall utilization (792+648+450)/3*792 = 79.5%
p. 65
Increased Demand
Demand now 700 units/ week i.e. cycle time 35
hours/ 700 units = 180 sec.
Have to explore new options
p. 66
Fig. 4.6
p. 67-68
Fig. 4.6
p. 67-68
Fig. 4.6/ p. 68
Detailed
Station
Reallocation
Table
4.3/ p.
70
Fig. 4.8/
p.71
Stn. 1
Stn. 2
Stn. 3
FG
Balancing Approaches
1. Given c, Minimize N
(approach used in OM courses, often heuristic based)
2. Given N, Minimize c
Both seek to minimize N c
(i.e. total time-capacity available on the line)
Can use algorithms developed for (1) to solve (2):
Iteratively solve (1) for ?
beginning from lower bound ?
until solution results in ?
Balancing Approaches
1. Given c, Minimize N
(approach used in OM courses, often heuristic based)
2. Given N, Minimize c
Both seek to minimize N c
(i.e. total time-capacity available on the line)
Can use algorithms developed for (1) to solve (2):
Iteratively solve (1) for progressively higher cycle times,
beginning from lower bound (clb = ? ),
until solution results in number of stations within N