& what do you head to do by next class?] I Fill out Table on slide 29. Calculate mean flow times for all possible sequences from 1-2-3-4 to 4-3-2-1. Confirm mean flow time of 3-2-1-4 sequence is the optimal. 3. Solve problem on slide 30 using SET Algo d! Heuristics: Efficiency Homework: Fill out.mean flow times for least 6 different sequences and submit your answers by next Saturday. Sequence Mean Flow Time Sequence Mean Flow Time 1-2-3-4 3-1-2-4 1-2-4-3 3-1-4-2 1-3-2-4 3-2-1-4 28.0 1-3-4-2 3-2-4-1 1-4-2-3 3-4-1-2 1-4-3-2 3-4-2-1 2-1-3-4 4-1-2-3 2-1-4-3 4-1-3-2 2-3-1-4 4-2-1-3 2-3-4-1 4-2-3-1 2-4-1-3 4-3-1-2 2-4-3-1 4-3-2-1 30 of 32 + Automatic Zoom Another Problem Instance . Consider 4 jobs and 5 machines with processing times as follows: Machine Job J1 J2 J3 J4 M1 3 1 4 2 M2 4 3 2 9 M3 6 5 8 8 M4 8 7 6 7 M5 5 5 6 5 3 E470, Dr. Cho 30 & what do you head to do by next class?] I Fill out Table on slide 29. Calculate mean flow times for all possible sequences from 1-2-3-4 to 4-3-2-1. Confirm mean flow time of 3-2-1-4 sequence is the optimal. 3. Solve problem on slide 30 using SET Algo d! Heuristics: Efficiency Homework: Fill out.mean flow times for least 6 different sequences and submit your answers by next Saturday. Sequence Mean Flow Time Sequence Mean Flow Time 1-2-3-4 3-1-2-4 1-2-4-3 3-1-4-2 1-3-2-4 3-2-1-4 28.0 1-3-4-2 3-2-4-1 1-4-2-3 3-4-1-2 1-4-3-2 3-4-2-1 2-1-3-4 4-1-2-3 2-1-4-3 4-1-3-2 2-3-1-4 4-2-1-3 2-3-4-1 4-2-3-1 2-4-1-3 4-3-1-2 2-4-3-1 4-3-2-1 30 of 32 + Automatic Zoom Another Problem Instance . Consider 4 jobs and 5 machines with processing times as follows: Machine Job J1 J2 J3 J4 M1 3 1 4 2 M2 4 3 2 9 M3 6 5 8 8 M4 8 7 6 7 M5 5 5 6 5 3 E470, Dr. Cho 30