00:01
Assembly line balancing problem is given the task immediate successor and the task time are given so we will write on the right side task immediate successor and the last one is task time these are all the details given so the task it varies from a to m a b c d e g g h i j k and m okay and the immediate successors are given as b c d e e f g h h i j k and m okay and the immediate successors are given as b c d e e e e f g and j, i, hk, j, k, j, k, m, and m is the end node.
00:52
Okay and the task time for each and everyone is given us 0 .5, 1 .4, 1 .2, 0 .7, 0 .5, 1 .0 .0 .0 .4, 0 .3.
01:11
0 .5, 0 .5, 0 .8, 0 .9 and 0 .3.
01:18
So based on this now we have to construct the network diagram or we can call it as precedence diagram.
01:25
Okay now we have to construct the precedence diagram based on the details given below.
01:32
So first we start from a.
01:34
So first start from a and b, c, d are the immediate successes.
01:43
And d are the immediate successes.
01:46
And the time is given as 0 .5 seconds.
01:49
Or some other thing.
01:51
So we will write it...