Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
31 views

Part 2 - Assignment Model: Topic 4

This document discusses assignment problems and provides examples of solving balanced, unbalanced, and maximization assignment problems using the Hungarian method. It explains the steps to solve assignment problems, including obtaining an opportunity cost table, finding row and column opportunity costs, and testing for optimality. Example 4.1 shows solving a balanced assignment problem to minimize total cost by assigning three workers to three projects. Example 4.2 discusses solving a maximization assignment problem by assigning staff to departments based on efficiency scores.

Uploaded by

MIN MD HULIFAH
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
31 views

Part 2 - Assignment Model: Topic 4

This document discusses assignment problems and provides examples of solving balanced, unbalanced, and maximization assignment problems using the Hungarian method. It explains the steps to solve assignment problems, including obtaining an opportunity cost table, finding row and column opportunity costs, and testing for optimality. Example 4.1 shows solving a balanced assignment problem to minimize total cost by assigning three workers to three projects. Example 4.2 discusses solving a maximization assignment problem by assigning staff to departments based on efficiency scores.

Uploaded by

MIN MD HULIFAH
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Topic 4:

Part 2 - Assignment Model

Prepared by,
Siti Shaliza Mohd Khairi
A simplified version of the transportation model.

Supply at each source and demand at each destination


limited to one unit.

Rows - People/ objects to assign with the tasks.

Columns - Jobs/ tasks need to be assigned.

In a balanced model supply equals demand.

In an unbalanced model supply does not equal demand.

Solving problem using:


HUNGARIAN METHOD
Example 4.1

Assign the three projects to three workers in a way that will result in the lowest
total cost to the shop. The assignment of workers to projects must be on a one to
one basis.
Project
Worker 1 2 3
Ahmad 11 14 6
Borhan 8 10 11
Chee 9 12 7
Solution:
Step 1
a) Subtract the smallest number in each row from every number in that
row.
1 2 3
Ahmad 11-6=5 8 0
Borhan 0 2 11-8=3
Chee 9-7=2 5 0
b) Subtract the smallest number in each column from every number in
that column.

1 2 3
Ahmad 5-0=5 8-2=6 0-0=0
Borhan 0 0 3
Chee 2 3 0

Step 2
Test the table resulting from step 1 to see whether an optimal assignment can be
made.
 Drawing the minimum possible lines on columns and/or rows such that all
zeros are covered.
 *Optimal ( No. of lines = No. of rows or columns)
1 2 3
Ahmad 5 6 0
Borhan 0 0 3
Chee 2 3 0
Step 3
 Not optimal (No. of lines < No. of rows or columns)
 Subtract the smallest number not covered by a line from itself and every other
uncovered number.
 Add this number at every intersection of any two lines.

1 2 3
Ahmad 3 4 0
Borhan 0 0 5
Chee 0 1 0

 Check optimality: (draw minimum lines covered all zeroes)


1 2 3
Ahmad 3 4 0
Borhan 0 0 5
Chee 0 1 0
Therefore, optimal solution is:

Worker Project Cost


Ahmad 3 6
Borhan 2 10
Chee 1 9
Total RM25
Unbalanced Assignment Problem
->> add dummy row if (#columns > #rows) or
- >> add dummy column if (#columns < #rows)
Project
Worker 1 2 3
Ahmad 11 14 6
Borhan 8 10 11
Chee 9 12 7
Dave 10 13 8

Project
Worker 1 2 3 Dummy
Ahmad 11 14 6 0
Borhan 8 10 11 0
Chee 9 12 7 0
Dave 10 13 8 0
Project
Worker 1 2 3 Dummy
(1) Ahmad 11 14 6 0
Borhan 8 10 11 0
Chee 9 12 7 0
Dave 10 13 8 0

Project
1 2 3 Dummy
(2) Ahmad 3 4 0 0
Borhan 0 0 5 0
Chee 1 2 1 0
Dave 2 3 2 0

Project
Worker 1 2 3 Dummy
Ahmad 2 3 0 0
Borhan 0 0 6 1
Chee 0 1 1 0
Dave 1 2 2 0
Therefore, optimal solution is:

Worker Project Cost


Ahmad 3 6
Borhan 2 10
Chee 1 9
Dave Dummy 0
Total RM25
Maximization Assignment Problem

Example 4.2

Assign each Staff to each Department based on efficiency


score.

Solution steps:
(1) Obtain opportunity cost table. (Subtract the largest
value in table with all values in the table)
(2) Find the row opportunity cost.
(3) Find the column opportunity cost.
(4) Test whether the cost table is already optimal or not.

You might also like