Question

Six jobs are to be processed through 6 machines. The processing time are given in hrs. To
process each one of the 6 jobs through all the machines, the optimum sequence is
6-4-5-3-1-2 using Gupta's heuristics method. Find the Makespan of that optimum
sequence using Gantt chart (use dark pencil or ballpen).
Processing time (hrs.)
Jobs
Mi
M2
M
МА
M5
M.
1
5
7
5
6
5
13
2
8
8
3
9
4
15
3
7
12
2
7
5
16
england
5
5
1
2
4
18
5
3
11
4
3
3
21
6
ON
10
13
7
1
1
20​

Answer 1

Answer:

luqgpufqgxpagpxuahipdgipdhihxid1o1sj91jdo2joh1lshpwubxupqgdpwhdupqgwhdwiphd8phwipdh2g

[email protected]