Explain Johnson’s procedure for determining an optimal sequence for processing n items on two machines. Determine the optimal sequence of jobs which minimizes the total elapsed time based on the following information (processing time on machines is given in hours and passing is not allowed): 20
|
Machines
|
Jobs
|
|
|
A
|
B
|
C
|
D
|
E
|
|
M1
M2
M3
|
5
2
3
|
7
1
7
|
6
4
5
|
9
5
6
|
5
3
7
|