We begin by recalling the flow time minimization problem on unrelated machines from last lecture: Given a set of machines and a set of jobs, define: rj ∈ Z, to be the release time of job j, pi,j ∈ Z, is the run time of job j on machine i, Cj is the time at which job j is completed and the flow time of j is Fj = Cj − rj . Our goal is to find a schedule S, s.t. ∑ j∈J Fj is minimized. In the onlin...