You are given the following set of tasks, along with their immediate predecessors.

 

a) Solve this line balancing problem using the ranked positional weight algorithm, assuming a cycle time C=17.

b) Propose an alternative cycle time that would improve average utilization of the line.

Transcribed Image Text:

task immediate predecessors processing time 1 [nan] [1] 3 [2] 4 4 [nan] 2 [nan] 2 [2] 7 [3, 4] 7 8 [7] [5] 1 10 [9, 6] 11 [8, 10] 12 [11] 7 LO 3. 3. 2. task immediate predecessors processing time 1 [nan] [1] 3 [2] 4 4 [nan] 2 [nan] 2 [2] 7 [3, 4] 7 8 [7] [5] 1 10 [9, 6] 11 [8, 10] 12 [11] 7 LO 3. 3. 2.

Answer rating: 100% (QA)

Draw precedence diagram as follows b An alternative ... View the full answer