Refer to Example 4. Find the optimal solution, i.e., the sequence of jobs that satisfies the due hours (i.e., end of the 8th hour) for all five jobs.

Transcribed Image Text:

Job 1 Job 2 Job 3 Job 4 Job 5 1. Drill 1 Lathe 2 Grind 2 Drill Mill 2. Lathe 2 Mill 2 Drill Grind 2 Drill 3. Grind Grind Mill 2 Lathe Lathe 4. Mill 2 Drill 2 Lathe 2 Grind Total (hours) 6 8 5