Find an assignment of the jobs to the machines such that total processing time is minimal.
Given bipartite Graph G = (V,E), determine its minimum weight matching:
1. Relabel edge weight of G: E' = {e' := e and e.w *= -1 | forall e in E}
2. Find minimum edge weight min_e in E'
3. E'' = {e'' := e' and e'.w += min_e | forall e' in E'}
4. Apply maximum weight matching problem to G = (V, E'')