1|P a g e

3. consider the following 2 machines and 6 jobs flow shop problem.

Job Machine 1 Machine 2
1 5 7
2 10 8
3 8 13
4 9 7
5 6 11
6 12 10

Solution:
Stage Unscheduled job Minimum t1k assignment partial sequence
1 1,2,3,4,5,6 t11 1= [1] 1*****
2 2,3,4,5,6 t51 5= [2] 15****
3 2,3,4,6 t42 4= [6] 15***4
4 2,3,6 t22 2= [5] 15**24
5 3,6 t31 3= [3] 153*24
6 6 t62 6= [4] 153624

So, the optimum schedule is 1-5-3-6-2-4

Now the makes span is as follows:
m/c1 1 5 3 6 2 4
5 11 19 31 41 50

m/c2 1 5 3 6 2 4

12 23 36 46 61
54
 2|P a g e

4. consider the following 2 machines and 5 jobs flow shop problem. Using Johnsons algorithm,
obtain the optimal sequence which will minimize the makes pan.
Job Machine 1 Machine 2
1 7 8
2 1 4
3 15 12
4 8 5
5 11 6

Solution:
Stage Unscheduled job Minimum t1k assignment partial sequence
1 1,2,3,4,5 t21 2= [1] 1****
2 1,3,4,5 t42 4= [5] 2***4
3 1,3,5 t52 5= [4] 2**54
4 1,3 t13 1= [2] 21*54
5 3 t32 3= [3] 21354

So, the optimum schedule is 2-1-3-5-4

Now the makes span is as follows:
m/c1 2 1 3 5 4
1 8 23 34 42
m/c2 2 1 3 5 4
1 5 8 16 23 35 41 42 47
 3|P a g e

5. Consider the following 3 machines and 5 jobs flow shop problem, check whatever Johnson
rule can be extended to this problem. If so, what is the optimal schedule and the corresponding
makes pan.
Job Machine 1 Machine 2 Machine 3
1 11 10 12
2 13 8 20
3 15 6 15
4 12 7 19
5 20 9 7

Solution:
Here, t1k,min =11; t2k,min =10;
t1k,min > t2k,min ; So, the Johnson extension rule is applicable.
Job Machine A=m/c1+m/c2 Machine B=m/c2+m/c3
1 21 22
2 21 28
3 21 21
4 19 26
5 29 16
So, the optimum schedule will be as follows: 4-3-1-2-5
m/c1 4 3 1 2 5
12 27 38 51 71
m/c2
19 27 33 38 48 51 59 71 80
m/c3

19 38 53 65 85
92
 4|P a g e

6. Consider the following 3 machines and 5 jobs flow shop problem, check whatever Johnson
rule can be extended to this problem. If so, what is the optimal schedule and the corresponding
makes pan.
Job Machine 1 Machine 2 Machine 3
1 7 4 3
2 9 5 8
3 5 1 7
4 6 2 5
5 10 3 4
Solution:
Here, t1k,min =5; t2k,min =5;
t1k,min = t2k,min ; So, the Johnson extension rule is applicable.
Job Machine A=m/c1+m/c2 Machine B=m/c2+m/c3
1 11 7
2 14 13
3 6 8
4 8 7
5 13 7
So, the optimum schedule is: 3-2-5-1-4
Now the makes span is as follows:
m/c1 3 2 5 1 4
5 14 24 31 37
m/c2 3 2 5 1 4
56 14 19 24 27 31 35 37 39
m/c3 3 2 5 1 4
6 13 19 27 31 35 38 39 44