The Assignment Problem
The Assignment Problem
In
many business situations, management needs to assign -
personnel to jobs, - jobs to machines, - machines to job locations, or - salespersons to territories.
Consider When
the situation of assigning n jobs to n machines.
a job i ( !,",....,n# is assigned to machine j ( !,", .....n#
that incurs a cost Cij.
The
objecti$e is to assign the jobs to machines at the least
possible total cost.
The Assignment Problem
This
situation is a special case of the Transportation
%odel And it is &no'n as the assignment problem.
(ere,
jobs
represent
)sources*
and
machines
represent )destinations.*
The
supply a$ailable at each source is ! unit And
demand at each destination is ! unit.
The Assignment Problem
+et ,ij denotes the assignment of facility I to job j such that,ij ., if the job j is not assigned to machine i !, if the job j is assigned to machine i
/olution %ethods of Assignment Problem
0numeration
%ethod
A list of all possible assignments among the gi$en resources 1 acti$ities are prepared. Then, an assignment 'ith the minimum cost ,time or distance is selected2
If there are n resources, then there 'ill be total n3 assignments
/imple4
%ethod %ethod
Transportation (ungarian
%ethod
0fficient method Wor&s on the principle of reducing the gi$en cost matri4 into a matri4 of opportunity costs 'hich sho's the relati$e penalties associated 'ith assigning a resource to an acti$ity as opposed to ma&ing the best or least cost assignment.
Types in Assignment Problem
!. ". 7. :. ;.
%a4imi5ation Case 6nbalanced AP 8estrictions 9 Prohibited Assignment Problem Tra$elling /alesman Problem Air Cre' Assignment
Assignment Problem
A<C
company has four plants each of 'hich can manufacture any one of the four products. Products cost differ from one plant to another as follo'sA ! " 7 : 77 :; :" "A < :. "? "@ :" C :7 7. 7; :; > 7" "7 "@ 7?
=ind out 'hich product each plant should produce to minimi5e cost. =ormulate it as +inear Programming Problem.
%a4imi5ation Problem7
=i$e
jobs are to be processed and machines are a$ailable. Any machine can process any job 'ith resulting profit (in rupees# as follo'sA ! " 7 : ; 7" :. :! "" "@ < 7? ": "A 7? 77 C :. "? 77 :! :. > "? "! 7. 7B 7; 0 :. 7B 7A 7B 7@
Cobs
=ind
the assignment pattern that ma4imi5es the sales.
Problem" on %a4imi5ation Case
<eta
Corporation has : plants each of 'hich can manufacture any of the four products. Production costs differ from one plant to another as do the sales re$enue. Di$en the cost data and re$enue as belo', obtain 'hich product should it plant produce to ma4imi5e its profit. /ales 8e$enues (8s Production Cost (8s E...#
E...# A < C > ! ;. B. ;; ;? " B? A. BA B; 7 :@ ;! ;7 ;: : B" A: A. B@ A < C > ! :@ ;; ;" ;; " B. B7 B" B: 7 :; :; :@ :? : B! B@ B? BB
6nbalanced AP
Add
dummy ro's or columns
8estrictions9Prohibited Assignment
/ometimes
There are three 'or&ers a$ailable to 'or& 'ith four
due to certain reasons an assignment cannot be made in a associated 'ith each 'oer&er is sho'n belo'. particular cell.
machines and the respecti$e cost (in rupees#is =urther due to certain reasons, 'or&er W! and
In
such cases, the cost of performing 'or&er W" cannot be assigned tomachine %: and that particular acti$ity by a particular %7 respecti$ely. resource is considered to be $ery %" assignment %7 >etermine %! the optimal and %: associated large (%!"or F# 7 W! B -cost. W"
W7 : ? !! " -!. ; @
Tra$elling /alesman
This is $ery similar to so the /ol$e the problem follo'ing tra$elling salesman problem
problem e4cept asassignment tominimi5e the totalcost per cycleadditional restriction that
A < C >
for an
0
A A salesman 'ho starts from city " ; A his home ! only7once and return < tra$els B each city ? " to his C home ? A : A city
> 0 !" ! : 7 B " ? ; -
Air Cre' Assignment Problem
Prachi Airlines that operates se$en days a 'ee& has a time table sho'n belo'. Cre's must ha$e a minimum layo$er of B hours bet'een flights. Gbtain the pairing off lights that minimi5es the layo$er time a'ay from home. =or any gi$en pairing, the cre' 'ill be based at the city that results in smaller layo$er.
=light Ho ! " 7 :
Chennai >epart A-.. A% @-..A% !.7. P% A.7. P%
%umbai Arri$al @-..Am !!-.. Am 7.7. P% @.7. P%
=light Ho. !.! !." !.7 !.:
%umbai >epart @-.. A% 7.7. P% ?-.. P%
Chennai Arri$al !!-..A% ;.7. P% !.-.. P%
!.-..A% !"-.. Hoon
=or each pair also mention the to'n 'here the cre' should be based
