Prof Vinay Pandit
ASSIGNMENT AND TRANSPORTATION THEORY1) What is an Assignment Problem?
The assignment problem can be stated as a problem where different jobs are to beassigned to different machines on the basis of the cost of doing these jobs. Theobjective is to minimize the total cost of doing all the jobs on different machines
The peculiarity of the assignment problem is only one job can be assigned to onemachine i.e., it should be a one-to-one assignment
The cost data is given as a matrix where rows correspond to jobs and columns tomachines and there are as many rows as the number of columns i.e. the number of jobs and number of Machines should be equal
This can be compared to demand equals supply condition in a balancedtransportation problem. In the optimal solution there should be only oneassignment in each row and columns of the given assignment table. one canobserve various situations where assignment problem can exist
assignmentof workers to jobs like assigning clerks to different counters in a bank or salesmanto different areas for sales, different contracts to bidders.
Assignment becomes a problem because each job requires different skills and thecapacity or efficiency of each person with respect to these jobs can be different.This gives rise to cost differences. If each person is able to do all jobs equallyefficiently then all costs will be the same and each job can be assigned to any person.
When assignment is a problem it becomes a typical optimization problem it cantherefore be compared to a transportation problem. The cost elements are givenand is a square matrix and requirement at each destination is one and availabilityat each origin is also one.