Question
The time taken (in hours) by five different machines for completing five different jobs is given below:
Find the optimal assignment.
Answer :
Word Count : 666
To solve the assignment problem, we need to find the optimal assignment of jobs to machines such that the total time taken is minimized. This is typically done using the Hungarian Algorithm, which is an efficient method for solving such problems. ### Step 1: Understand the Problem We have a cost matrix where each element represents the time taken by a machine to complete a job. The goal is to assign each job to a unique machine such that the total time is minimized. ### Step 2: Apply the Hungarian Algorithm The Hungarian Algorithm involves the following steps: 1. Subtract the minimum value of each row from all elements of that row. 2. Subtract the minimum value of each column from all elements of that column. 3. Cover all zeros in the matrix ______ _______ ____ ______ ____ ______ _____.
_____ ________ _____ ____ _________ _____ __________ ________ ________ _____ _____.
____ ______ __________ _______ _________ __________ ____ _________ ________ ____.
___ ____ __________ ___ _____ _____ _______ __________ ________.
_________ _______ ___ _________ ______ ___ _________ ______.
___ _________ _________ _____ ___ _________.
______ ______ ________ ____ ______ ______ __________ ________ ____.
__________ _________ ___ ___ __________ _________.
_______ __________ _________ _________ ______ ________ ________ __________ ________ _________ ______ ____.
_____ ________ ________ ___ _________ ________ ________ _________ ________ ________ __________ __________.
_______ _________ ______ __________ ___ ___ _______ _________ ______ _____ ____ _________.
_________ _______ ____ _______ __________ ___ ________ ____ ___.
_______ __________ ____ _________ __________ _________ _____ _____ ______ ____ ________ _____.
________ ______ _______ ____ _____.
__________ ___ ___ ___ ______ ___ _________ ______ ____.
___ _______ ______ __________ ________ __________ _________ _____ __________ __________.
____ _____ _____ _______ __________ ______ _________ ___.
______ _____ _____ _____ ____ __________ _____ __________ ________ _______.
______ ____ _____ _____ ________ ___ ________ _________ ___ _______ ______.
______ ________ _____ ___ __________ ________ _______ _________ __________.
__________ ________ ____ ______ ________ ________.
_________ _______ __________ ________ ___ __________.
_____ __________ ___ ________ _______ ______ __________ _______ ____ _____.
_______ ________ _________ ____ ____ _______.
__________ _______ ___ _____ ______ ______ _______ ____ __________ _____ _________.
_________ _____ ___ __________ ______ ___ ________ _____ ________ ______ _______ _______.
_____ ____ ____ __________ ___ ________ ___ ___ _______.
____ _______ ______ _______ ______ _____ ________ ______ _____.
_____ ____ ____ _____ _______ __________ __________ _________ _______ _____ ____ ___.
____ _________ _______ ________ ___.
____ __________ ____ _______ ___ _________ _____.
_______ _____ __________ _________ ____ _________ _____ ________ ____.
_________ _____ _______ ________ _____ ________ _____.
_________ __________ _______ __________ __________ ________ ____.
___ ____ ___ ______ ___ _________ _______ _________ __________ ____ _______ _____.
______ ____ _________ __________ ________ ________ ______ ____ _________ _____ ___ _______.
____ _______ _____ ______ _________ ________ ____ ____ ____ _________.
______ ______ __________ ______ ______ _____ ___ __________ _______ ______ _______.
___ ___ __________ __________ _______.
___ ___ __________ _____ ___ ____.
___ _______ ________ ________ _________ __________ ________ ________ __________ ___.
___ ___ _____ _____ ________ _______ ______ _______ ___ ________ ____.
________ _________ ________ ______ _______ ________ _________ ____ ______ ____.
______ _________ _______ ____ ____ __________ _______ __________ __________ __________.
_______ ________ _______ ___ _________ __________ ________ _____ _________ ______ _________.
_________ ________ ______ _______ ___ ________ _________ ______ _______ __________ _________ ___.
________ ______ _______ ______ _____.
_________ ___ ________ __________ ___ ____ _____ ____ __________ ______.
_________ _________ ______ _____ _____ ______ _____ ____ ______ ______.
__________ ____ _________ ___ __________ ________ _________ _______ __________ ____ ______ _________.
____ ___ _____ __________ _______ _____ ______ _____ _______ ____.
_____ _____ __________ _________ ______ _______ ______ ___ ______ ______.
_______ _______ ___ ___ __________ ___ __________ _________.
___ _________ _______ ______ ____ ____ _______ ____ __________ __________ _________ ________.
_______ ___ _________ ______ _______ __________.
______ _______ ______ _________ __________ _____.
__________ ________ ________ ________ _________ ____ ________ ________ ________.
________ _____ ___ _______ ________ ___.
_____ ___ _______ _____ ______ ____.
_____ ___.
Get Full Answer on WhatsApp
To solve the assignment problem, we need to find the optimal assignment of jobs to machines such that the total time taken is minimized. This is typically done using the Hungarian Algorithm, which is an efficient method for solving such problems. ### Step 1: Understand the Problem We have a cost matrix where each element represents the time taken by a machine to complete a job. The goal is to assign each job to a unique machine such that the total time is minimized. ### Step 2: Apply the Hungarian Algorithm The Hungarian Algorithm involves the following steps: 1. Subtract the minimum value of each row from all elements of that row. 2. Subtract the minimum value of each column from all elements of that column. 3. Cover all zeros in the matrix ______ _______ ____ ______ ____ ______ _____.
_____ ________ _____ ____ _________ _____ __________ ________ ________ _____ _____.
____ ______ __________ _______ _________ __________ ____ _________ ________ ____.
___ ____ __________ ___ _____ _____ _______ __________ ________.
_________ _______ ___ _________ ______ ___ _________ ______.
___ _________ _________ _____ ___ _________.
______ ______ ________ ____ ______ ______ __________ ________ ____.
__________ _________ ___ ___ __________ _________.
_______ __________ _________ _________ ______ ________ ________ __________ ________ _________ ______ ____.
_____ ________ ________ ___ _________ ________ ________ _________ ________ ________ __________ __________.
_______ _________ ______ __________ ___ ___ _______ _________ ______ _____ ____ _________.
_________ _______ ____ _______ __________ ___ ________ ____ ___.
_______ __________ ____ _________ __________ _________ _____ _____ ______ ____ ________ _____.
________ ______ _______ ____ _____.
__________ ___ ___ ___ ______ ___ _________ ______ ____.
___ _______ ______ __________ ________ __________ _________ _____ __________ __________.
____ _____ _____ _______ __________ ______ _________ ___.
______ _____ _____ _____ ____ __________ _____ __________ ________ _______.
______ ____ _____ _____ ________ ___ ________ _________ ___ _______ ______.
______ ________ _____ ___ __________ ________ _______ _________ __________.
__________ ________ ____ ______ ________ ________.
_________ _______ __________ ________ ___ __________.
_____ __________ ___ ________ _______ ______ __________ _______ ____ _____.
_______ ________ _________ ____ ____ _______.
__________ _______ ___ _____ ______ ______ _______ ____ __________ _____ _________.
_________ _____ ___ __________ ______ ___ ________ _____ ________ ______ _______ _______.
_____ ____ ____ __________ ___ ________ ___ ___ _______.
____ _______ ______ _______ ______ _____ ________ ______ _____.
_____ ____ ____ _____ _______ __________ __________ _________ _______ _____ ____ ___.
____ _________ _______ ________ ___.
____ __________ ____ _______ ___ _________ _____.
_______ _____ __________ _________ ____ _________ _____ ________ ____.
_________ _____ _______ ________ _____ ________ _____.
_________ __________ _______ __________ __________ ________ ____.
___ ____ ___ ______ ___ _________ _______ _________ __________ ____ _______ _____.
______ ____ _________ __________ ________ ________ ______ ____ _________ _____ ___ _______.
____ _______ _____ ______ _________ ________ ____ ____ ____ _________.
______ ______ __________ ______ ______ _____ ___ __________ _______ ______ _______.
___ ___ __________ __________ _______.
___ ___ __________ _____ ___ ____.
___ _______ ________ ________ _________ __________ ________ ________ __________ ___.
___ ___ _____ _____ ________ _______ ______ _______ ___ ________ ____.
________ _________ ________ ______ _______ ________ _________ ____ ______ ____.
______ _________ _______ ____ ____ __________ _______ __________ __________ __________.
_______ ________ _______ ___ _________ __________ ________ _____ _________ ______ _________.
_________ ________ ______ _______ ___ ________ _________ ______ _______ __________ _________ ___.
________ ______ _______ ______ _____.
_________ ___ ________ __________ ___ ____ _____ ____ __________ ______.
_________ _________ ______ _____ _____ ______ _____ ____ ______ ______.
__________ ____ _________ ___ __________ ________ _________ _______ __________ ____ ______ _________.
____ ___ _____ __________ _______ _____ ______ _____ _______ ____.
_____ _____ __________ _________ ______ _______ ______ ___ ______ ______.
_______ _______ ___ ___ __________ ___ __________ _________.
___ _________ _______ ______ ____ ____ _______ ____ __________ __________ _________ ________.
_______ ___ _________ ______ _______ __________.
______ _______ ______ _________ __________ _____.
__________ ________ ________ ________ _________ ____ ________ ________ ________.
________ _____ ___ _______ ________ ___.
_____ ___ _______ _____ ______ ____.
_____ ___.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★