Linear Programming Methods of Line Balancing
Assume that a job is broken down into elements tasks and the total duration of all such tasks is 28 minutes. The cycle time i, e, the length of time that the work piece is available at each work station is 10 minutes. Thus the minimum number of stations required are 28/10 say 3 and the maximum number of work station may be 6 i, e, equal to the number of tasks involved.
The problem now reduces, to find out the next number of work station needed and which tasks will be assigned to which station. Figure shows the precedence diagram.
Figure (a) precedence DiagramThree types of constraints equations namely