Scribd
Upload
4 views

Assignment_Problems

An assignment problem is a type of Linear Programming Problem focused on assigning tasks to agents at minimal cost or maximum profit, ensuring one-to-one assignments. The Hungarian Algorithm is the primary method for solving these problems, involving steps like creating a cost matrix, row and column reductions, and making assignments based on zeros in the matrix. Applications include HR management, operations, marketing, and logistics, where the algorithm guarantees optimal solutions efficiently.

Uploaded by

Pritam Chavan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

Assignment_Problems

An assignment problem is a type of Linear Programming Problem focused on assigning tasks to agents at minimal cost or maximum profit, ensuring one-to-one assignments. The Hungarian Algorithm is the primary method for solving these problems, involving steps like creating a cost matrix, row and column reductions, and making assignments based on zeros in the matrix. Applications include HR management, operations, marketing, and logistics, where the algorithm guarantees optimal solutions efficiently.

Uploaded by

Pritam Chavan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

 Definition: An assignment problem is a special type of Linear

Programming Problem (LPP) where the goal is to assign a number of


tasks to an equal number of agents at the minimum cost (or
maximum profit), ensuring one-to-one assignments.

 Examples:

o Assigning workers to jobs

o Assigning machines to tasks

o Assigning salespeople to territories

2. Features of an Assignment Problem

 Square matrix (number of tasks = number of agents)

 One agent can do one task only

 Objective: Minimize cost or maximize profit

 The Hungarian Algorithm is the most efficient method for solving


it

🔹 3. Hungarian Algorithm: Step-by-Step (Minimization Problem)

✅ Step 1: Create the Cost Matrix

List all costs of assigning agents to tasks in a square matrix.

✅ Step 2: Row Reduction

Subtract the smallest value in each row from every element of the row.

✅ Step 3: Column Reduction

Subtract the smallest value in each column from every element of the
column.

✅ Step 4: Draw Minimum Number of Lines

Cover all zeros in the matrix with the minimum number of


horizontal/vertical lines.

✅ Step 5: Check for Optimality

 If the number of lines = number of rows (or columns), optimal


assignment is possible.

 If not, go to Step 6.

✅ Step 6: Adjust the Matrix

 Find the smallest uncovered value.


 Subtract it from all uncovered elements.

 Add it to elements at the intersections of lines.

 Repeat Step 4 until the number of lines = size of the matrix.

✅ Step 7: Make the Assignment

Choose one zero from each row/column ensuring no two assignments are
in the same row/column.

4. Maximization Assignment Problem

➕ Convert Maximization to Minimization:

 Subtract each element from the maximum element in the matrix.

 Then apply the Hungarian Algorithm as a minimization problem.

5. Applications of the Hungarian Algorithm

Application Exampl
Area e

HR Assigning employees to projects based


Management on skills

Operatio Assigning machines to jobs to minimize


ns processing time

Marketi Assigning salespeople to regions to


ng maximize sales

Procureme Assigning suppliers to orders based


nt on cost

Assigning delivery vehicles to


Logistics
routes to reduce travel time

6. Benefits of the Hungarian


Algorithm

 Simple, systematic, and


reliable

 Works for both cost


minimization and profit
maximization

 Time-efficient even for large


datasets

 Guarantees optimal solution

Q. 1 A company has to assign for workers A, B , C and D to four


jobs w,x,y,z. the cost matrix is given below.

Worke Job W Job X Job y Job z


rs
A 600 800 0 500

B 300 200 0 500

C 0 100 200 300

D 300 400 0 700

Q. 2 A Car rental company has one car at each of four depots


1,2,3 and 4. A customer in each five areas A, B, C, D and E
requires a Car.

The distance in Kms between the depots and areas where


customers are, is given in the following distance matrix.

Area (Distances in Kms )


A B C D E
1 50 70 110 60 70
Depo
2 80 50 50 60 50
ts
3 60 70 100 70 30
4 100 50 80 40 20

Q. 3 A Computer centre has four expert programmers. The centre


need four applications programmes to be developed. The head of
computer centre after carefully studying, estimates. The time
required by the expert to develop the
Application Programme. Find the Assignment Schedule so that
time will be minimised.

Expe A B C D
rt
1 120 100 80 90
2 80 90 110 70
3 110 140 120 100
4 90 90 80 90
Q.4 Five men are available to do five different jobs. From past records, the
time (in hours) that each man takes to do each job is known and is given
in the following table:

Find out how men should be assigned the jobs in way that will minimize
the total time taken.

Q.5 A company has 4 machines on which to do 3 jobs. Each job can be


assigned to one and only one machine. The cost of each job assignments
for minimum cost?

Q. 5 A pharmaceutical company producing a single product sold it


through five agencies situated in different cities. All of a sudden, there
rouse a demand for the product in another five cities that didn’t have any
agency of the company. The company is now facing the problem of
deciding on how to assign the existing agencies in order to despatch the
product to needy cities in such a way that the travelling distance is
minimized. The distance between the surplus and deficit cities (in km) is
given in the following table.
Q. 6 A manufacturing company is engaged in producing three types of
products: A, B & C. The production department produces, each day,
components sufficient to make 50 units of A, 25 units of B & 30 units of C.
The management is confronted with the problem of optimizing the daily
production of the products in the assembly department, where only 100
man-hours are available daily for assembling the products. The following
additional information is available:

The company has a daily order commitment for 20 units of products A and
a total of 15 units of products B & C. Formulate this problem as an LP
model so as to maximize the total profit.

Q. 7 A national truck rental service has a surplus of one truck in each of


the cities, 1, 2, 3, 4, 5 & 6 and a deficit of one truck in each of the cities 7,
8, 9, 10, 11 & 12. The distances (in km) between the cities with a surplus
and cities with deficit are displayed in the table below:
Find the optimal solution so that travelling distance is minimized.

Q. 8

You might also like