ASSIGNMENT

MODEL
Prepared By:
14M207 - Anbarasan
14M208 - Anguvignesh
14M209 - Anish Prajivin N
14M210 - Aravinth
14M211 - Arunmozhi
14M212 - Ashik
ASSIGNMENT MODEL
An assignment problem seeks to minimize the total cost assignment of
m workers to m jobs, given that the cost of worker i performing job j is
cij.
It assumes all workers are assigned and each job is performed.
An assignment problem is a special case of a transportation problem
in which all supplies and all demands are equal to 1; hence
assignment problems may be solved as linear programs.
The network representation of an assignment problem with three
workers and three jobs is shown on the next slide.
PROBLEM - 1

Best-ride airlines that operates seven days a week has the following time-
table.
Crews must have a minimum layover of 5 hours between flights. Obtain
the pairing of flights that minimizes layover time away from home. For any
given pairing, the crew will be based at the city that results in the smaller
layover. For each pair also mention the city where crew should be based.
 SOLUTION

To determine optimal assignments, first we calculate layover times

from the above time table.
Calculating values for table 1 (layover time) for Crew at Delhi
To determine optimal assignments, first we calculate layover times
from the above time table.
Calculating values for table 1 (layover time) for Crew at Mumbai
The composite layover time matrix (table 3) is obtained by selecting the smaller element from the
two corresponding elements of table 1 & 2. The layover time marked with ( * ) represents that the
crew is based at Mumbai, otherwise based at Delhi. For example, corresponding to flight no.1 and
101 in table 1 & 2, we select the minimum between (24, 22), i.e., 22 for Mumbai. Therefore, this
element is marked with ( * ). In this way, table 3 is completed and shown below.
Since the no of assignments is equal to the no of rows and columns
the solution is optimal
 Solution

1 102

2 104

3 101

4 103
PROBLEM - 2

The Winner Publishing Company employs typists on hourly basis. There

are five typists for service and their charges and speeds are different.
According to an earlier understanding only one job is given to one typist
and the typist is paid for full hour even if he works for a fraction of an
hour. Find the least cost allocation for the following data:
 SOLUTION

The following matrix gives the cost incurred if the ith typist (i = A, B, C,
D & E) executes the jth job (j = P, Q, R, S & T):
Solution

A T

B R

C S

D P

E Q