Scribd
Upload
92 views

Unbalanced Assignment Problem Questions

The document provides information about an unbalanced assignment problem involving road repair work by 5 contractors. It includes the following details: 1) A city corporation needs to repair 4 roads and has received bids from 5 contractors, with each contractor's time and cost for each road provided in a table. 2) The method for solving the unbalanced assignment problem involves subtracting elements in each row and column to find the optimal assignment that minimizes total time. 3) Applying the method reveals the optimal assignment is: Contractor A repairs road 5, B repairs road 2, C repairs road 3, D repairs road 1, and E repairs road 4, for a total time of 376.

Uploaded by

SYED ADNAN ALAM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
92 views

Unbalanced Assignment Problem Questions

The document provides information about an unbalanced assignment problem involving road repair work by 5 contractors. It includes the following details: 1) A city corporation needs to repair 4 roads and has received bids from 5 contractors, with each contractor's time and cost for each road provided in a table. 2) The method for solving the unbalanced assignment problem involves subtracting elements in each row and column to find the optimal assignment that minimizes total time. 3) Applying the method reveals the optimal assignment is: Contractor A repairs road 5, B repairs road 2, C repairs road 3, D repairs road 1, and E repairs road 4, for a total time of 376.

Uploaded by

SYED ADNAN ALAM
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

INSTITUTE-USB

DEPARTMENT-BBA
Bachelor Of Business Administration
Operation Research(20BAT-263)
Instructor: Dr. Gifty Malhotra

Unbalanced Assignment Operation Research(BAT-308)


DISCOVER . LEARN . EMPOWER
Operation Research(BAT-308)
Problem: Practice Question
OPERATION RESEARCH
Course Outcome
CO Number Title Level

CO1 Define and formulate linear programming problems and Understand

appreciate their limitations

CO2 Solve linear programming problems using appropriate techniques Application

and optimization solvers, interpret the results obtained and


translate solutions into directives for action.
CO3 Conduct and interpret post-optimal and sensitivity analysis and Analyze
explain the primal-dual relationship.
CO4 Develop mathematical skills to analyze and solve integer Evaluate

programming and network models arising from a wide range of


applications.
CO5 Understand the usage of game theory and Simulation for Solving Application
Business Problem

https://www.or.tum.de/en/home/
2
Unbalanced Assignment Problem

A city corporation has decided to carry out road repairs on main four arteries of the city.
The government has agreed to make a special grant of Rs. 50 lakh towards the cost with
a condition that the repairs be done at the lowest cost and quickest time. If the
conditions warrant, a supplementary token grant will also be considered faviurably. The
corporation has floated tenders and five contractors have sent in their bids. In order to
expedite work only one road will be awarded to only one contractor. Find the best way
of assigning repair work to the contractors and the costs.
If I is necessary to seek supplementary grants, what should be the amount sought?
Which of the five contractors will be unsuccessful in his bid?
EXAMPLE 3 OF UNBALANCED PROBLEM

Solve the following assignment problem to get it


completed in least time:

JOBS
A B C D E
MACHINES

1 62 78 50 101 82
2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80
5 0 0 0 0 0
METHOD

• STEP 1
Subtract all the element of each row from the largest
elements of respective rows.

JOBS
A B C D E
MACHINES

1 39 23 51 0 19
2 13 0 23 11 25
3 24 19 0 40 30
4 39 23 0 10 7
5 0 0 0 0 0
METHOD
• STEP 2
Subtract the least element of each column
from other elements of respective column
and allot jobs.
JOBS
V A B C D E
MACHINES

1 39 23 51 0 19
2 13 0 23 11 25
3 24 19 0 40 30
4 39 23 0 10 7
5 0 0 0 0 0
METHOD
• STEP 3
Cancel all zeros by drawing lines less than
the number of rows or columns.

JOBS
A B C D E
MACHINES

1 39 23 51 0 19
2 13 0 23 11 25
3 24 19 0 40 30
4 39 23 0 10 7
5 0 0 0 0 0
METHOD

• STEP 4
• Choose the least uncovered element and add it to all
intersection points and subtract it from all uncovered
elements.
JOBS A B C D E
1 32 23 51 0 12
MACHINES

2 6 0 23 11 18
3 17 19 0 40 23
4 32 23 0 10 0
5 0 7 7 7 0
METHOD
• Hence the optimum solution is:
(i) A5 0
(ii) B2 84
(iii) C3 111
(iv) D1 101
(v) E4 80
Hence the total profit will be
0+ 84+ 111 +101+ 80 = 376
Recommended Text Books:

• Budnik, Frank S. Dennis Mcleavey, Reichard : Principles of Operations Research, 2nd ed.,

• Richard Irwin, Illinois – All India Traveler Bookseller, New Delhi, 1995.

• Gould, F.J. etc. : Introduction to Management Science, Englewood Cliffs, New Jersey, Prentice Hall Inc., 1993.

• Mathur, K and Solow, D. : Management Science, Englewood, New Jersey, Prentice Hall Inc., 1994.

Reference Books:

• N.D. Vohra : Quantitative Techniques in Management, Tata McGraw Hill, 2101.

• Sharma, J.K.: Operations Research : Theory and Applications, New Delhi, Macmillian India Ltd., 1997.

• Narang A.S. : Linear Programming Decision-Making. New Delhi, Sultan Chand, 1995.
THANK YOU

For queries
Email: [email protected]

11

You might also like