$1.$ In class, we describe a procedure to minimize makespan for an m$-$parallel identical machines problem and given the solution we then try to minimize the mean flow time. Describe a procedure that you would apply if you want to minimize the mena flow time as your primary $($most important$)$ criteria and minimize makespan as your secondary criteria. Apply your procedure to the following $3-$machine problem.

Job $123456789101112$

pj $3567912151620252733$