Scribd
Upload
23 views16 pages

Chapter 4

Uploaded by

behailu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
23 views16 pages

Chapter 4

Uploaded by

behailu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 16

Chapter four

Assignment Problems

Slide
1
Assignment Problem
 An assignment problem seeks to minimize the total
cost assignment of n workers to n jobs, given that
the cost of worker i performing job j is cij. Or
assigning n jobs to n machines when a job i
(=1,2,....,n) is assigned to machine j (=1,2, .....n) that
incurs a cost Cij.
 Assigning people to tasks is a common application
of the assignment problem. However, the assignees
need not be people. They also could be machines,
or vehicles, or plants, or even time slots to be
assigned tasks.

Slide
2
Assumptions of Assignment problems

1. The number of assignees and the number of the


tasks are the same.( This number is donated by n)
2. Each assignee is to be assigned to exactly one task
3. Each task is to be performed by exactly one assignee
4. There is a cost cij associated with assignee i(i=1,2,
…,n) performing task j(j=1,2…,3)
5. The objective is to determine how all n assignments
should be made in order to minimize the total cost.

Slide
4
Solution to Assignment problems
Hungarian Method
 Step 1: Problem formulation
 Step 2: For each row, subtract the minimum number in
that row from all numbers in that row.
 Step 3: For each column, subtract the minimum number
in that column from all numbers in that column.
 Step 4: Draw the minimum number of lines to cover all
zeroes. If this number = n , STOP -- an assignment can be
made.
 Step 5: Determine the minimum uncovered number (d).
• Subtract d from uncovered numbers.
• Add d to numbers covered by two lines.
• Numbers covered by one line remain the same.
• Then, GO TO STEP 4.
Slide
5
Example
 A production supervisor is considering how he should assign the
four jobs that are performed, to four of the workers working
under him. He want to assign the jobs to the workers such that the
aggregate time to perform the job in the least. Based on the
previous experience, he has the information on the time taken by
the four workers in performing these jobs, as given in below

Slide
7
The final assignments is 1-B, 2-D, 3-C,
Slide
9
Example

Slide
10
Column Reduction of Opportunity (Row Reduction)
Costs

Slide
11
Determine the Minimum Number of Lines Needed to Cover
the Zeros

Further
FurtherRevision
Revisionofofthe
theCost
CostTable
Table

Slide
12
Optimal Assignments

Slide
13
Special Situations
 Among those situations are the following:
 The number of rows does not equal the number of columns.
 The problem involves maximization rather than minimization.
 Certain matches are undesirable or not allowed.
 Multiple optimal solutions exist.

Slide
14
Unbalanced Assignment Problems
 In such situations, dummy column(s)/row(s), whichever is
smaller in number, are inserted with zeros as the cost
elements

A-1 B-4 C-3 D-2

Slide
15
Constrained/Prohibited/ Assignment
Problems
 It happens sometimes that a worker cannot perform a certain job
or is not to be assigned a particular job. To cope with this
situation, the cost of performing that job by such person is taken to
be extremely large
 Example: Determine the optimal set of pairings given the following
cost table. Note that assignment B-3 is undesirable, as denoted by
the M in that position:

Slide
16
Multiple Optimal Solutions
 In some cases, there are multiple optimal solutions to a problem.
This condition can be easily recognized when making the
optimal assignments.
 Example: Given this final assignment table, identify the optimal
solutions:

Slide
17
Maximization
 One extra step must be added to the start of the process.
 Identify the largest value in each column and then subtract all
numbers in each column from the column maximum.
 Example: Let’s consider the following assignment table where the
values are unit profits.

The optimal assignment will be to match A with 2, B


with 1 and C with 3 and the maximum profit is Br. 92 =
Slide
18
End of Chapter
Four

Slide
19

You might also like