computeInitialFeasibleSolution() just gets the minimum value from each row and puts them in labelByJob. However, computeInitialFeasibleSolution() is only called once, right after calling reduce(), so the minimum value in each row is zero. Since labelByJob is already zero, this does nothing.
Likewise in greedyMatch(), labelByWorker and labelByJob are filled with zero's, so subtracting them does nothing.
computeInitialFeasibleSolution()
just gets the minimum value from each row and puts them inlabelByJob
. However,computeInitialFeasibleSolution()
is only called once, right after callingreduce()
, so the minimum value in each row is zero. SincelabelByJob
is already zero, this does nothing.Likewise in
greedyMatch()
,labelByWorker
andlabelByJob
are filled with zero's, so subtracting them does nothing.