Abstract:
This case presents a special type of linear programming problem in which 'n' items are to be assigned among 'n' receivers, one item to a receiver, such that the total return resulting from the assignment is optimized. The question is how should the tasks be allocated to each person in order to minimize the total person-hours?