12. With the help of the following example, describe the algorithm for solving an 'n-job, 3-machines'

sequencing problem:

Transcribed Image Text:

Processing time (in hours) Job Machine A Machine B Machine C 34215 38752 12345 3 3 5 8 2 10 7 6