Scribd
Upload
16 views3 pages

Cost Minimization Assignment Guide

The document outlines a cost minimization problem involving the assignment of jobs to machines based on a given cost matrix. It details the steps of row reduction, column reduction, and the assignment of jobs to minimize total costs, resulting in an optimal assignment with a minimum total cost of Rs. 133. The final assignments are specified for each machine and job, confirming that all jobs and machines are uniquely assigned.

Uploaded by

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

Cost Minimization Assignment Guide

The document outlines a cost minimization problem involving the assignment of jobs to machines based on a given cost matrix. It details the steps of row reduction, column reduction, and the assignment of jobs to minimize total costs, resulting in an optimal assignment with a minimum total cost of Rs. 133. The final assignments are specified for each machine and job, confirming that all jobs and machines are uniquely assigned.

Uploaded by

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

Given Cost Matrix

Machine \ Job 1 2 3 4 5

I 93 36 15 79 14

II 50 59 80 94 62

III 20 34 30 91 50

IV 32 57 12 31 30

V 25 33 59 28 15

Objective: Minimise total cost

STEP 1: Row Reduction


Subtract the minimum element of each row from every element of that row.

Row minima

Row I → min = 14
Row II → min = 50
Row III → min = 20
Row IV → min = 12
Row V → min = 15

Row-reduced matrix

Machine \ Job 1 2 3 4 5

I 79 22 1 65 0

II 0 9 30 44 12

III 0 14 10 71 30

IV 20 45 0 19 18

V 10 18 44 13 0
STEP 2: Column Reduction
Subtract the minimum element of each column from that column.

Column minima

Column 1 → min = 0
Column 2 → min = 9
Column 3 → min = 0
Column 4 → min = 13
Column 5 → min = 0

Column-reduced matrix

Machine \ Job 1 2 3 4 5

I 79 13 1 52 0

II 0 0 30 31 12

III 0 5 10 58 30

IV 20 36 0 6 18

V 10 9 44 0 0

STEP 3: Assignment of Zeroes


We now assign jobs such that:
One job per machine
One machine per job
Using independent zeroes

Optimal Assignments

Machine Job Cost

I 5 14

II 2 59

III 1 20

IV 3 12
Machine Job Cost

V 4 28

✔ All jobs and machines are uniquely assigned.

STEP 4: Minimum Total Cost

Minimum Cost = 14 + 59 + 20 + 12 + 28

Minimum Total Cost = Rs. 133 ​

✅ Final Answer (Exam-Ready)


Optimal Assignment:

Machine I → Job 5
Machine II → Job 2
Machine III → Job 1
Machine IV → Job 3
Machine V → Job 4

Minimum total assignment cost = Rs. 133 ​

If you want:

✍️ Very short exam version


📊 Zero-marking diagram explanation
🧠 How to identify independent zeroes quickly

Just tell me 😊

Give me this answer in pdf format downloadable

Your PDF is ready ✅

You might also like