I want to solve job assignment problem using Hungarian algorithm of Kuhn and Munkres in case when matrix is not square. Namely we have more jobs than workers.In this case adding additional row is recommended to make matrix square.For example in the following link.And here task IV is assumed to be done.But in real we do not have man D. Who will actually do task IV?Can someone explain this phenomena?In general I want to complete all tasks by loading workers uniformly and get maximum cost.So how to implement this task by using job assignment algorithm above?
Job assignment problem
algorithms;linear programming;assignment problem