We have N jobs and N workers to do these jobs. It is known and known (as a positive numerical value) at what cost each worker will do each job. We want to assign jobs to workers in such a way that the total cost of completion of all jobs is minimal among other possible alternative assignments. For this problem, the input is a matrix representing worker / job costs, and the output is a list of tuples showing which work will be done by which worker, and Write the algorithm trying to reach the solution with OBUR / HURRY (GREEDY) technique as pseudocode. What does your algorithm mean? exhibits voracious / hasty behavior, please explain. What is the time complexity of your algorithm? Interpret if your algorithm always produces the best (optimum) result for each instance of the problem.
We have N jobs and N workers to do these jobs. It is known and known (as a positive numerical value) at what cost each worker will do each job. We want to assign jobs to workers in such a way that the total cost of completion of all jobs is minimal among other possible alternative assignments. For this problem, the input is a matrix representing worker / job costs, and the output is a list of tuples showing which work will be done by which worker, and
Write the
exhibits voracious / hasty behavior, please explain. What is the time complexity of your algorithm? Interpret if your algorithm always produces the best (optimum) result for each instance of the problem.
Step by step
Solved in 3 steps