Example: Job assignment Problem

  • Input
    • n jobs
    • n employees
    • an n x n matrix A
    • where Aij be the cost if person i performs job j
  • Problem : Find one-to-one matching of the n employees to the n jobs so that the total cost is minimized
  • In informal terms, the problem is to choose a single number from each row such that
    1. No two numbers are chosen from the same columns
    2. The sum of the chosen numbers is minimized