he Assignment Problem is a special type of linear programming problem where the goal is to assign tasks to resources (workers, machines, jobs) in such a way that the total cost or time is minimized (or profit maximized).
쮽킹 Key Features
- Number of jobs = number of workers (square matrix)
- Each job is assigned to only one worker
- Each worker does only one job
- Objective: Minimize cost / Maximize profit
쮽킹 Solution Method: Hungarian Method
Steps:
- Row Reduction ᎓ subtract smallest element in each row
- Column Reduction ᎓ subtract smallest element in each column
- Cover all zeros with minimum number of lines
- Test for optimality:
- If lines = number of rows ᔒ optimal solution
- Else ᔒ adjust matrix and repeat
- Make assignments using independent zeros
Exercise Files