Scribd
Upload
73 views5 pages

Assignment Problem SPL Case

Four jobs can be done on four machines, with costs for each job-machine combination provided in a matrix. The goal is to assign jobs to machines to minimize total cost while avoiding setup costs from changing machines. Through row and column reductions of the cost matrix, two optimal solutions are found that both achieve the minimum total cost of Rs. 23.

Uploaded by

Santhosh Kc
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
73 views5 pages

Assignment Problem SPL Case

Four jobs can be done on four machines, with costs for each job-machine combination provided in a matrix. The goal is to assign jobs to machines to minimize total cost while avoiding setup costs from changing machines. Through row and column reductions of the cost matrix, two optimal solutions are found that both achieve the minimum total cost of Rs. 23.

Uploaded by

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

Four different jobs can be done on four different machines.

The set-up and


take-down time costs are assumed to be prohibitively high for change overs.
The matrix below gives the cost in rupees of producing job I on machine j.

Machines
M1 M2 M3 M4
J1 5 7 11 6

Jobs
J2 8 5 9 6
J3 4 7 10 7
J4 10 4 8 3

How should be the jobs be assigned to the various machines so that the total cost is minimized?
5 7 11 6

8 5 9 6

4 7 10 7

10 4 8 3
Cost Matrix 0 2 6 1

3 0 4 1

0 3 6 3

7 1 5 0
Row Reduction Matrix
0 2 2 1

3 0 0 1

0 3 2 3

7 1 1 0

Column Reduction Matrix


0 2 2 1

3 0 0 1

0 3 2 3

7 1 1 0

No. of Lines= 3< 4(Order 0 1 1 0


of the Matrix)
4 0 0 1

0 2 1 2

8 1 1 0

No. of Lines= 3< 4(Order 0 0 0 0


of the Matrix)
5 0 0 2

0 1 0 2

8 0 0 0

No. of Lines= 4=Order of the Matrix, Hence


Optimum Solution is achieved
Solution-1

M1 M2 M3 M4

J1 0 0 0 0

J2 5 0 0 2
Optimum Assignment Policy
J3 0 1 0 2 Jobs Machines Optimum Cost
J1 M3 11
J4 8 0 0 0 J2 M2 5
J3 M1 4
J4 M4 3
Total Rs.23
Solution-2

M1 M2 M3 M4

J1 0 0 0 0

J2 5 0 0 2
Optimum Assignment Policy
J3 0 1 0 2 Jobs Machines Optimum Cost
J1 M1 5
J4 8 0 0 0 J2 M2 5
J3 M3 10
J4 M4 3
Total Rs.23

Hence, the given problem is of Multiple Optimal Solution

You might also like