See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/347849096

Fuzzy Assignment problems

Article · August 2020

CITATIONS READS

3 3,092

1 author:

Mohamed Muamer
Misurata University
9 PUBLICATIONS 19 CITATIONS

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

On Solving Fuzzy Rough Linear Fractional Programming Problem View project

All content following this page was uploaded by Mohamed Muamer on 24 December 2020.

The user has requested enhancement of the downloaded file.

 Vol.10 August 2020 40

Fuzzy Assignment problems

Mohamed Muamer
Department of Mathematics, Faculty of Science. Misurata University. Libya

Abstract: In this paper, we deal with solving a fuzzy Assignment Problem (FAP), in
this problem C̃ denotes the cost for assigning the n jobs to the n workers and C̃ has
been considered to be triangular fuzzy numbers. The Hungarian method is used for
solving FAP by using ranking function for fuzzy costs . A numerical example is con-
sidered by incorporating a fuzzy numbers into the costs.

Keywords: Assignment problem, Fuzzy numbers, Robust ranking function, Hungar-

ian method.

1. Introduction example is given for the sake of illustra-

tion.
An assignment problem is a special type
2. Preliminaries
of linear programming problem which
In this section, some basic definitions are
deals with assigning various activities
presented.
(jobs or task or sources) to an equal num-
2.1 Fuzzy Sets [4, 8, 12]
ber of service facilities (men, machine,
laborers, etc.) on one to one basis in such Let 𝑋 denoted a universal set. Then a
a way so that the total time or total cost fuzzy subset 𝐴̃ of 𝑋 is defined by its
involved is minimized and total sale or membership function
total profit is maximized or the total sat- 𝜇𝐴 (𝑥) ∶ 𝑋 → [0,1]
isfaction of the group is maximized. A fuzzy set 𝐴̃ can be characterized as a
Lin and Wen (2004), Solved the assign- set of ordered pairs of element 𝑥 and
ment problem with fuzzy interval num- grade 𝜇𝐴 (𝑥) and is often written as:
ber costs by a labeling algorithm. Isabels 𝐴̃
and Uthra (2012), Presents an assign-
= {( 𝑥, 𝜇𝐴 (𝑥)) ∶ 𝑥𝜖𝑋 , 𝜇𝐴 (𝑥)𝜖[0,1] }
ment problem with fuzzy costs repre-
sented by linguistic variables which are
Definition 2.1. (𝛼 − 𝐿𝑒𝑣𝑒𝑙 𝑠𝑒𝑡)
replaced by triangular fuzzy numbers.
Srinivasan and Getharamani (2013), The 𝛼 − 𝑙𝑒𝑣𝑒𝑙 set of a fuzzy set 𝐴̃ is
solving fuzzy assignment problem using defined as ordinary set 𝐴𝛼 for which the
one's assignment method and applied degree of its membership function ex-
Reuben's ranking technique. Saleh ceed the 𝐿𝑒𝑣𝑒𝑙 𝛼:
(2014), Presents a multi-objective as- 𝐴𝛼 = {𝑥 ∈ 𝑋 ∶ 𝜇𝐴 (𝑥) ≥ 𝛼 , 0 ≤ 𝛼
signment problem with interval parame- ≤ 1 } = [𝐴𝐿𝛼 , 𝐴𝑈𝛼 ],
ters. The coefficients of FAP problems Where
are assumed to be exactly known. In 𝐴𝐿 = 𝑖𝑛𝑓 {𝑥 ∈ 𝑋: 𝜇𝐴 (𝑥) ≥ 𝛼 } 𝑎𝑛𝑑
{ 𝑈𝛼
practice, the coefficients (some or all) are 𝐴𝛼 = 𝑠𝑢𝑝 {𝑥 ∈ 𝑋: 𝜇𝐴 (𝑥) ≥ 𝛼 }
not exact due to the errors of measure- Definition 2.2. (Normal Fuzzy Set)
ment or vary with market conditions A fuzzy set 𝐴̃ is called normalized if
…etc. 𝐴1 = {𝑥 ∈ ℛ | 𝜇𝐴 (𝑥) = 1} ≠ 𝜑 .
In this paper, the proposed the fuzzy as- The set of all points 𝑥𝜖 𝑋 with 𝜇𝐴 (𝑥) =
signment problem FAP is solve by the 1 is called core of a fuzzy set 𝐴̃ .
Hungarian method using the ranking
The support of a fuzzy set 𝐴̃ is the ordi-
function for fuzzy costs. An illustrative
nary subset of 𝑋
41 Fuzzy Assignment problems

𝑠𝑢𝑝𝑝 𝐴 = {𝑥 ∈ 𝑋: 𝜇𝐴 (𝑥) > 0 } Let 𝐴̃ = (𝑎1 , 𝑎2 , 𝑎3 ) and 𝐵̃ =

Definition 2.3. (Convex Fuzzy Sets) (𝑏1 , 𝑏2 , 𝑏3 ) be two T.F.N, then we will
A fuzzy set 𝐴̃ in convex set 𝑋 = ℛ 𝑛 is study some operations as follows:
said to be a convex fuzzy set if and only
1 Addition:
if its 𝛼 − 𝑙𝑒𝑣𝑒𝑙 set are convex. 𝐴̃ + 𝐵̃ = (𝑎1 , 𝑎2 , 𝑎3 ) + (𝑏1 , 𝑏2 , 𝑏3 )
An alternative and more direct definition {
= (𝑎1 + 𝑏1 , 𝑎2 + 𝑏2 , 𝑎3 + 𝑏3 )
of a convex fuzzy set as follows: 2 The symmetric (image): {− 𝐴̃ =
A fuzzy set 𝐴̃ is convex if and only if (−𝑎3 , −𝑎2 , −𝑎1 )
𝜇𝐴 (𝜔𝑥1 + (1 − 𝜔)𝑥2 ) 3 Subtraction:
≥ 𝑚𝑖𝑛{ 𝜇𝐴 (𝑥1 ), 𝜇𝐴 (𝑥2 ) } 𝐴̃ − 𝐵̃ = (𝑎1 , 𝑎2 , 𝑎3 ) − (𝑏1 , 𝑏2 , 𝑏3 )
𝑓𝑜𝑟 𝑎𝑙𝑙 𝑥1 , 𝑥2 ∈ ℛ 𝑛 𝑎𝑛𝑑 𝜔 ∈ [0,1]. {
= (𝑎1 − 𝑏3 , 𝑎2 − 𝑏2 , 𝑎3 − 𝑏1 ),
4 Multiplication:
2.2 Fuzzy Numbers [1, 8, 12]
à ×
A fuzzy number is a convex normalized (a1 b1 , a2 b2 , a3 b3 ), a1 ≥ 0
fuzzy set of the real line ℛ whose mem- B̃ =
̃ { (a1 b3 , a2 b2 , a3 b3 ), a1 < 0 , a3 ≥ 0
bership function is piecewise continuous. (a1 b3 , a2 b2 , a3 b1 ), a3 < 0
Definition 2.4. (Triangular Fuzzy Num-
bers) 5 Division:
A fuzzy number 𝐴̃ is said to be a trian- 𝑖𝑓 0 ∉ 𝐵̃
gular fuzzy numbers (T.F.N) if it has the = (𝑏1 , 𝑏2 , 𝑏3 ) 𝑡ℎ𝑒𝑛 𝐴̃ ÷ 𝐵̃
following membership function: 𝑎1 𝑎2 𝑎3
=( , , )
𝜇𝐴 (𝑥) 𝑏3 𝑏2 𝑏1
𝑥 − 𝑎1 Remark: As mentioned earlier that
𝑎1 ≤ 𝑥 ≤ 𝑎2 𝐴 ̃
𝑎2 − 𝑎1 𝐴̃ − 𝐴̃ ≠ 0̃ , ̃ ≠ 1̃ it is follows that
= 𝑥 − 𝑎3 𝐴

𝑎2 − 𝑎3
𝑎2 ≤ 𝑥 ≤ 𝑎3 the 𝐶̃ solution of the fuzzy linear equa-
{ 0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 tion 𝐴̃ + 𝐵̃ = 𝐶̃ is not as would expect
𝐵̃ = 𝐶̃ − 𝐴̃ . The same annoyance ap-
Then we say that 𝐴̃ is triangular fuzzy pears when solving equation 𝐴̃ × 𝐵̃ =
number, written as: 𝐶 ̃
𝐶̃ whose solution is not given by 𝐵̃ = ̃
𝐴̃ = (𝑎1 , 𝑎2 , 𝑎3 ) 𝑤ℎ𝑒𝑟𝑒 𝑎1 , 𝑎2 , 𝑎3 𝐴
∈ℛ .
The interval of confidence for the trian- 2.3 Ranking function [ 3, 9 ]
gular fuzzy number A ranking function ℜ ∶ 𝐹(𝑅) ⇢ 𝑅
𝐴̃ = (𝑎1 , 𝑎2 , 𝑎3 ) at 𝛼 − 𝑙𝑒𝑣𝑒𝑙 𝑠𝑒𝑡 is where 𝐹(𝑅) set of fuzzy numbers de-
defined as: fined on set of real numbers, maps each
𝐴𝛼 = [ 𝑎𝛼𝐿 , 𝑎𝛼𝑈 ]
= [𝑎1 + (𝑎2 − 𝑎1 )𝛼 , 𝑎3 − (𝑎3 − 𝑎2 )𝛼 ], ∀ 𝛼𝜖[0,1] fuzzy number into real number, where a
natural order exists.
2.2.1 The Arithmetic Operations 2.3.1 Ranking function for triangu-
on Fuzzy Numbers [2, 5, 9] lar fuzzy numbers
In this section, we introduce the arithme- The ranking function for 𝐴̃ =
tic of fuzzy numbers. ̃
(𝑎1 , 𝑎2 , 𝑎3 ) denoted ℜ( 𝐴) proposed
by F.Reuben's is defined by :
 Vol.10 August 2020 42

1 1
ℜ( 𝐴̃) = ∫0 ( 𝑎𝛼𝐿 + 𝑎𝛼𝑈 )𝑑𝛼 Theorm 2.1. If 𝐴̃ =
2
Where (𝑎1 , 𝑎2 , 𝑎3 ) 𝑎𝑛𝑑 𝐵̃ = (𝑏1 , 𝑏2 , 𝑏3 ) be
𝑎𝛼𝐿 = 𝑎1 + (𝑎2 − 𝑎1 )𝛼 two triangular fuzzy numbers,
{ , 𝐴̃ < 𝐵̃ 𝑖𝑓 𝑎𝑛𝑑 𝑜𝑛𝑙𝑦 𝑖𝑓 ℜ( 𝐴̃ ) < ℜ( 𝐵̃ )
𝑎𝛼𝑈 = 𝑎3 − (𝑎3 − 𝑎2 )𝛼 ∀ 𝛼𝜖[0,1] 𝑇ℎ𝑒𝑛 { 𝐴̃ = 𝐵̃ 𝑖𝑓 𝑎𝑛𝑑 𝑜𝑛𝑙𝑦 𝑖𝑓 ℜ( 𝐴̃ ) = ℜ( 𝐵̃ )
𝐴̃ > 𝐵̃ 𝑖𝑓 𝑎𝑛𝑑 𝑜𝑛𝑙𝑦 𝑖𝑓 ℜ( 𝐴̃ ) > ℜ( 𝐵̃ )

3. Problem Formulation
3.1 Assignment Problem
The Assignment problem (AP) can be stated in the form of 𝑛 × 𝑛 cost matrix
(𝐶𝑖𝑗 )𝑛×𝑛 of real numbers as given in the table (1) following:
Table.1. Assignment cost

Job →
Job1 Job2 Job k Job n
Person↓
Person 1 𝑐11 𝑐12 𝑐1𝑘 𝑐1𝑛
Person k 𝑐𝑘1 𝑐𝑘2 𝑐𝑘𝑘 𝑐𝑘𝑛
Person n 𝑐𝑛1 𝑐𝑛2 𝑐𝑛𝑘 𝑐𝑛𝑛

Suppose there are 𝑛 jobs to be per-

Mathematically assignment problem formed and 𝑛 persons are available for
(AP) can be stated as: doing these jobs. Assume that each
𝑗=𝑛
𝑀𝑖𝑛 𝑍 = ∑𝑖=𝑛 𝑖=1 ∑𝑗=1 𝑐𝑖𝑗 𝑥𝑖𝑗 person can do one job at a time and
𝑆𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜: each job can be assigned to one person
(𝐴𝑃):
∑𝑖=𝑛
𝑖=1 𝑥𝑖𝑗 = 1 , 𝑗 = 1,2, … , 𝑛, only.
{ ∑𝑗=𝑛
𝑗=1 𝑥𝑖𝑗 = 1 , 𝑖 = 1,2, … , 𝑛 2).
Let 𝐶̃𝑖𝑗 be the triangular fuzzy num
Where 𝑥𝑖𝑗 = bers cost (payment) if 𝑗𝑡ℎ job is as-
1, 𝑖𝑓 𝑡ℎ𝑒 𝑖𝑡ℎ 𝑝𝑒𝑟𝑠𝑜𝑛 𝑎𝑠𝑠𝑖𝑔𝑛𝑚𝑒𝑛𝑡 𝑡ℎ𝑒 𝑗𝑡ℎ 𝑗𝑜𝑏
{ , signment to 𝑝𝑡ℎ person (see table
0 , 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 The problem is to find an assignment
𝑥𝑖𝑗 so that the total cost for perform-
3.2 Fuzzy Assignment Problems ing all the jobs is minimum

Table.2. Fuzzy assignment cost

Job →
Job1 Job2 Job k Job n
Person ↓
Person 1 𝐶̃11 𝐶̃12 𝐶̃1𝑘 𝐶̃1𝑛
Person k 𝐶̃𝑘1 𝐶̃𝑘2 𝐶̃𝑘𝑘 𝐶̃𝑘𝑛
Person n 𝐶̃𝑛1 𝐶̃𝑛2 𝐶̃𝑛𝑘 𝐶̃𝑛𝑛
43 Fuzzy Assignment problems

The chosen Fuzzy Assignment Prob- ∑_(𝑖 = 1)^(𝑖 = 𝑛 )▒〖𝑥^ ∗ 〗_𝑖𝑗 =

lem (FAP) may be formulated into the 1 , 𝑗 = 1,2, … , 𝑛, 𝑎𝑛𝑑 ∑_(𝑗 = 1)^(𝑖 =
following fuzzy linear programming 𝑛 )▒〖𝑥^ ∗ 〗_𝑖𝑗 = 1 , 𝑖 = 1,2, … , 𝑛,
problem: 𝑗=𝑛 ̃
𝑗=𝑛 ̃ 𝑡ℎ𝑒𝑛 ∑𝑖=𝑛
𝑖=1 ∑𝑗=1 𝐶𝑖𝑗 𝑥𝑖𝑗 ≤
𝑀𝑖𝑛 𝑍̃ = ∑𝑖=𝑛𝑖=1 ∑𝑗=1 𝐶𝑖𝑗 𝑥𝑖𝑗
𝑆𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜: 𝑗=𝑛 ̃
(𝐹𝐴𝑃):
∑𝑖=𝑛
∑𝑖=𝑛 ∗
𝑖=1 ∑𝑗=1 𝐶𝑖𝑗 𝑥 𝑖𝑗
𝑖=1 𝑥𝑖𝑗 = 1 , 𝑗 = 1,2, … , 𝑛,
{ ∑𝑗=𝑛
𝑗=1 𝑥𝑖𝑗 = 1 , 𝑖 = 1,2, … , 𝑛 3.3 Assignment Algorithm
Such that 𝑥𝑖𝑗 = An approach is proposed for transfor-
1, 𝑖𝑓 𝑡ℎ𝑒 𝑝𝑡ℎ 𝑝𝑒𝑟𝑠𝑜𝑛 𝑎𝑠𝑠𝑖𝑔𝑛𝑚𝑒𝑛𝑡 𝑡ℎ𝑒 𝑗𝑡ℎ 𝑗𝑜𝑏
{ ,
mation Fuzzy Assignment Problem (
0 , 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 FAP) into a crisp Assignment Problem
𝑗=𝑛 ̃
∑𝑖=𝑛
𝑖=1 ∑𝑗=1 𝐶𝑖𝑗 𝑥𝑖𝑗 : Total fuzzy cost (AP) using the ranking function for
for performing all the jobs. fuzzy assignment cost matrix.
Step 1. For the entire fuzzy assignment
Definition 3.1. Optimal Solution of cost matrix (𝐶̃𝑖𝑗 )𝑛×𝑛 , find ranking
function for all fuzzy assignment cost
Fuzzy Assignment Problems
matrix (ℜ(𝐶̃𝑖𝑗 ))𝑛×𝑛
The optimal solution of the Fuzzy As-
signment Problem is the set of non- Step 2. Replace the fuzzy cost 𝐶̃𝑖𝑗 by
negative integers { 𝑥𝑖𝑗 } which satis- their respective ℜ(𝐶̃𝑖𝑗 ) , then the
fuzzy assignment cost matrix given in
fies the following characteristics:
the table (3) following as:
1. ∑𝑖=𝑛
𝑖=1 𝑥𝑖𝑗 = 1 , 𝑗 = 1,2, … , 𝑛, and
∑𝑖=𝑛
𝑗=1 𝑥𝑖𝑗 = 1 , 𝑖 = 1,2, … , 𝑛,

2. If there exist any set of non-

negative integers {𝑥 ∗ 𝑖𝑗 } such
that

Table.3. Ranking Fuzzy assignment cost

Job →
Job 1 Job 2 Job 𝑘 Job 𝑛
Person ↓
Person 1 ℜ(𝐶̃11 ) ℜ(𝐶̃12 ) ℜ(𝐶̃1𝑘 ) ℜ(𝐶̃1𝑛 )

Person 𝑘 ℜ(𝐶̃𝑘1 ) ℜ(𝐶̃𝑘1 ) ℜ(𝐶̃𝑘𝑘 ) ℜ(𝐶̃𝑘𝑛 )

Person 𝑛 ℜ(𝐶̃𝑛1 ) ℜ(𝐶̃𝑛1 ) ℜ(𝐶̃𝑛𝑘 ) ℜ(𝐶̃𝑛𝑛 )

Mathematically ranking fuzzy assign-

ment problem can be stated as:
 Vol.10 August 2020 44

𝑗=𝑛 ̃
𝑀𝑖𝑛 ℜ( 𝑍̃ ) = ∑𝑖=𝑛𝑖=1 ∑𝑗=1 ℜ(𝐶𝑖𝑗 ) 𝑥𝑖𝑗
crisp Assignment Problem which the
𝑆𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜: optimal solution of the Fuzzy Assign-
∑𝑖=𝑛 ment Problem.
𝑖=1 𝑥𝑖𝑗 = 1 , 𝑗 = 1,2, … , 𝑛,
Numerical Example
{ ∑𝑗=𝑛
𝑗=1 𝑥𝑖𝑗 = 1 , 𝑖 = 1,2, … , 𝑛 Consider a fuzzy assignment problem
with rows representing seven persons
Where 𝑥𝑖𝑗 = and columns representing the seven
1, 𝑖𝑓 𝑡ℎ𝑒 𝑝𝑡ℎ 𝑝𝑒𝑟𝑠𝑜𝑛 𝑎𝑠𝑠𝑖𝑔𝑛𝑚𝑒𝑛𝑡 𝑡ℎ𝑒 𝑗𝑡ℎ 𝑗𝑜𝑏 jobs with Assignment cost. The cost
{ ,
0 , 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 matrix (𝐶̃𝑖𝑗 )𝑛×𝑛 is given whose ele-
ments are triangular fuzzy numbers as
Step 3. Since ℜ(𝐶̃𝑖𝑗 ) are crisp values, follows in the table (4):
the above problem is obviously the
crisp Assignment Problem (AP )
which can be solved by Hungarian
Method, the optimal solution of the

Table 4. Fuzzy assignment cost for example

Job →
Job1 Job 2 Job 3 Job 4 Job 5 Job 6 Job 7
Person↓
(12,14,16
Person 1 (11,12,13) (5,6,13) (7, 9, 11) (3,10,11) (3, 8, 13) (7,9,11)
)

Person 2 (7,9,11) (9,10,11) (5,8,11) (8 ,10, 12) (5,6,7) (9,11,13) (8,10,11)

Person 3 (3,9,15 ) (7,8,13) (6,7,9) (4,5,12) (4, 6, 12 ) (8,15,18) (3,4,17)

Person 4 (5,6,13 ) (13,17,21) (5,7,13) (8, 10, 16) (8,15,18) (7,11,15) (3,9,13)

Person 5 (6,8,10) (6,9,12) (9,11,13) (11,13,15) (8,9,10) (6, 8, 12) (4, 8, 12)

Person 6 (10,14, 18) (9,13,17) (4,6,10) (2,4,18) (3,8,17) (6,12,14) (7,8, 13)

Person 7 (4,7, 10) (7,8,13) (5,6,7) (1,8, 13) (8,9,14) (5,12,19) (7,8,17)
1 1
ℜ(𝐶̃11 ) = ∫0 (𝑎𝛼𝐿 + 𝑎𝛼𝑈 )𝑑𝛼
2
The problem is to find the optimal as- 1 1
signment so that the total cost of job as- ℜ(𝐶̃11 ) = ∫0 ((11 + 𝛼 + 13 −
2
signment becomes minimum. 𝛼))𝑑𝛼
Solution: To solve the problem, we have ℜ(𝐶̃11 ) = 12
to determine the ranking index of the cost Similarly, the ranking for the fuzzy
matrix (𝐶̃𝑖𝑗 )𝑛×𝑛 . The 𝛼 − 𝑙𝑒𝑣𝑒𝑙 of fuzzy costs matrix are calculated as follows
cost 𝐶̃11 = (11,12,13) define as: in the table (5):
[𝑎𝛼𝐿 , 𝑎𝛼𝑈 ] = [11 + 𝛼 , 13 − 𝛼] for
which
 Vol.10 August 2020 45

Table 5. Ranking fuzzy assignment cost for example

Job →
Job1 Job 2 Job 3 Job 4 Job 5 Job 6 Job 7
Person↓
Person 1 12 7.5 9 8.5 8 14 9
Person 2 9 10 8 10 6 11 9.75
Person 3 9 9 7.25 6.5 7 14 7
Person 4 7.5 17 8 11 14 11 8.5
Person 5 8 9 11 13 9 8.5 8
Person 6 14 13 6.5 7 9 11 9
Person 7 7 9 6 7.5 10 12 10

Now solving the resulting assignment problem by using Hungarian method:

Let 𝑝𝑖 𝑎𝑛𝑑 𝑞𝑗 be row 𝑖 𝑎𝑛𝑑 column 𝑗 minimum costs.
Step 1. For the cost matrix in the table 5, determine the minimum in each column see
table 6.
Step 2. For the cost matrix resulting from Step 1 , each column subtracts the column
Table 6. Min the column
Job →
Job1 Job 2 Job 3 Job 4 Job 5 Job 6 Job 7
Person↓
Person 1 12 7.5 9 8.5 8 14 9
Person 2 9 10 8 10 6 11 9.75
Person 3 9 9 7.25 6.5 7 14 7
Person 4 7.5 17 8 11 14 11 8.5
Person 5 8 9 11 13 9 8.5 8
Person 6 14 13 6.5 7 9 11 9
Person 7 7 9 6 7.5 10 12 10
Min the
𝑞1 = 7 𝑞2 = 7.5 𝑞3 = 6 𝑞4 = 6.5 𝑞5 = 6 𝑞6 = 8.5 𝑞7 = 7
column
minimum we have the follwos table (7):
Step 3. For the cost matrix resulting from Step 2, identify each row minimum and
Table 7. Subtracts the column minimum
Job →
Job1 Job 2 Job 3 Job 4 Job 5 Job 6 Job 7
Person↓
Person 1 5 0 3 2 2 5.5 2
Person 2 2 2.5 2 3.5 0 2.5 2.75
Person 3 2 1.5 1.25 0 1 5.5 0
Person 4 0.5 9.5 2 4.5 8 2.5 1.5
Person 5 1 1.5 5 6.5 3 0 1
Person 6 7 5.5 0.5 0.5 3 2.5 2
Person 7 0 1.5 0 1 4 3.5 3
subtract it from all the entries of the row, (see the table 8,9).
 Vol.10 August 2020 46

Table 8. Min the row

Job → Min the
Job1 Job 2 Job 3 Job 4 Job 5 Job 6 Job 7
Person↓ row
Person 1 5 0 3 2 2 5.5 2 𝑝1 = 0
Person 2 2 2.5 2 3.5 0 2.5 2.75 𝑝2 = 0
Person 3 2 1.5 1.25 0 1 5.5 0 𝑝3 = 0
Person 4 0.5 9.5 2 4.5 8 2.5 1.5 𝑝4 = 0.5
Person 5 1 1.5 5 6.5 3 0 1 𝑝5 = 0
Person 6 7 5.5 0.5 0.5 3 2.5 2 𝑝6 = 0.5
Person 7 0 1.5 0 1 4 3.5 3 𝑝7 = 0

Table 9. Subtracts the row minimum

Job →
Job1 Job 2 Job 3 Job 4 Job 5 Job 6 Job 7
Person↓
Person 1 5 0 3 2 2 5.5 2
Person 2 2 2.5 2 3.5 0 2.5 2.75
Person 3 2 1.5 1.25 0 1 5.5 0
Person 4 0 9 1.5 4 7.5 2 1
Person 5 1 1.5 5 6.5 3 0 1
Person 6 6.5 5 0 0 2.5 2 1.5
Person 7 0 1.5 0 1 4 3.5 3
Step 4. Identify the optimal solution as the feasible assignment associated with the
zero elements of the cost matrix obtained in Step 3, (see table 10).

Table 10. The optimal solution

Job →
Job1 Job 2 Job 3 Job 4 Job 5 Job 6 Job 7
Person↓
Person 1 5 0 3 2 2 5.5 2

Person 2 2 2.5 2 3.5 0 2.5 2.75

Person 3 2 1.5 1.25 0 1 5.5 0

Person 4 0 9 1.5 4 7.5 2 1

Person 5 1 1.5 5 6.5 3 0 1

Person 6 6.5 5 0 0 2.5 2 1.5

Person 7 0 1.5 0 1 4 3.5 3

 Vol.10 August 2020 47

The optimal solution calls for assignment 5. Li, F. et.al. (2012); Study on solution
problem as follows: models and methods for the fuzzy assign-
person 1→ 𝐽2 , person 2→ 𝐽5 , person 3→ ment problems, Expert Systems with Ap-
𝐽7 , person 4→ 𝐽1 , person 5→ 𝐽6 , person plications, 39. 11276-11283.
6 → 𝐽4 , person 7 → 𝐽3 6. Lin J.C. and Wen, P. U. (2004);
The fuzzy optimal total cost is The labeling algorithm for the assign-
𝑍̃ = 𝐶̃12 + 𝐶̃25 + 𝐶̃37 + 𝐶̃41 + 𝐶̃56 ment and transportation problem, Naval
+ 𝐶̃64 + 𝐶̃73 Research Logistics Quarterly, 2, 83-97.
= (31 , 40, 87 ) 7. Lu, H., Huang, G., and He, L.;
4. Conclusion (2011), An inexact rough –interval fuzzy
In this paper, the assignment costs are con- linear programming method for generat-
sidered as imprecise numbers described by ing conjunctive water. Applied mathe-
triangular fuzzy numbers. Moreover, the matics modeling, 35, 4330-4340 .
fuzzy assignment problem has been trans- 8. Maleki, H. R.at (2000); Linear pro-
formed into crisp assignment problem using gramming with fuzzy variables , Fuzzy sets
ranking function for fuzzy costs matrix and systems 109. 21-33.
and solves it by Hungarian method. 9. Nagarajan, R. and Solairaju, A.
5. REFERENCES (2010); Applied Robust ranking technique
for solving assignment problems with fuzzy
1. Ammar, E. and Muamer, M. "Algorithm costs, International Journal of Computer
for solving multi objective linear fractional Applications,(0975-8887).volume 6. No.4
programming problem with fuzzy rough co- 10. Pal, S. K.; (2004), Soft data mining
efficients" Open Science Journal of Mathe- computational theory of perceptions and
matics and Application, 4(1), (2016), 1-8. rough fuzzy approach , Information Sci-
2. Dubois, D. and Prade, H. "Fuzzy sets ences, 163, (1-3), 5-12.
and system: Theory and Applications" Ac- 11. Salehi, A. ; (2014), An approach for
ademic Press, New York, (1980). solving multi-objective assignment problem
3. Isabel, K. R. and Uthra, D. G. (2012); with interval parameters. Management Sci-
An application of linguistic variables in ences, 4(2014), 2155-2160.
assignment problem with fuzzy costs, In- 12. Sakawa, M. "Fuzzy sets and interac-
ternational Journal of Computational En- tive multi objective optimization" Plenum
gineering Research, 2(4), 1065-1069. press, New York, (1993).
4. Kaufman, A. and Gupta, M. M.
"Fuzzy Mathematical Models in Engi-
neering and Management Science" Els.
Scie. Publisher, B.V., New York (1988).

View publication stats