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
______ _________ ______ __________ ____ __________ ________ ________ _____ ____ _______.
_________ _______ ___ __________ _________ _____ __________ ___ ____ ______ ___ ________.
______ ___ _____ ______ __________ ________ ____ ___ _____ _____.
___ _______ ________ ______ _______ ______ ______ ____ ___ ___ ______ _________.
_______ ___ ______ ________ ______ _____ _______ ______.
______ ____ ___ ________ _________ ___.
____ _________ _____ __________ _____ ______ _________ __________ _________ ____ _______.
_________ ______ ______ ________ ____ ___ _______ _____.
________ ________ __________ _______ ______ __________ _________ ______ _______.
____ _____ ___ _______ ______ ____.
_____ _________ _______ _______ _______ ____ _____ _______ ___ __________ _________ ____.
_____ ______ ____ _________ ______ ______.
_____ __________ ___ ___ ____ ________ _____ __________.
____ _______ ___ ______ __________.
_______ _______ _________ ________ ________.
_______ ___ __________ _________ ______ ______ __________ _______.
________ __________ _________ _____ _____ ___ ____ ________ ________ ________ ____ _________.
__________ ___ ________ _______ ___ _____ _____ _________ _________ ___ _______.
________ ________ ______ _________ _____.
_____ ___ ________ _________ _____ ________.
___ ______ _____ ________ _______ ________ ___ __________.
________ ______ ___ __________ _____ ____.
___ _____ _______ ____ ____.
____ __________ ___ __________ ___.
__________ _________ _______ ___ ____.
_____ _____ ________ _____ ____ _________ _____ ______ ____.
_______ ________ _________ ________ ________ _____ ______ __________ ___ __________ ________ ______.
__________ ___ _________ ________ ________ ______.
______ ____ _____ _______ ____.
______ __________ ________ ___ ________ ________ _______ _______ _____ ____ ____.
_________ ____ ___ ______ ____ __________ ____ ______ _____ _________ _____ ____.
___ ___ ___ _________ ____ _________.
________ _________ __________ ____ __________.
_______ ____ ________ _______ ____ _______.
______ __________ ____ __________ __________ __________ _________.
_____ _____ _______ _______ ___ ______ _______ ___ ________ _______ ___ _____.
_________ ___ ______ _____ ____ _______ __________ ________ _________.
__________ _______ ____ _________ __________ ____ ___.
_____ ________ _____ ___ _____ _____ ________ _________ ____ ______ _______ ______.
__________ _____ ______ _________ _________ _______ _____ _________ ____ ______.
______ _____ ___ _______ _________ ________ ________ _________ ____.
____ _____ ___ ________ ____ ____ ___ _________ ______ ___ ______ ___.
____ ________ _______ _________ ________ __________ ___ ___ _____ ___ ___.
________ ______ __________ __________ ___ ________ ________ _______ ________ ____ _____ ____.
__________ _________ ____ _________ _______ ______ ____ ___ __________ __________.
__________ __________ ________ ___ ______.
___ ______ ___ __________ _____ _________ ___ ______ ______ ________.
____ _________ ___ ________ _________ ___.
_____ ____ ______ __________ _______ ______.
_________ _____ __________ ___ _____ ____ _____.
____ ______ _________ ______ ______ _________ ________.
__________ __________ ________ _____.
Skip in 10
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 using a minimum number of horizontal and vertical lines. 4. If the number of lines equals the number of rows (or columns), an optimal assignment is possible. If not, adjust the matrix and repeat the process. 5. Make the assignments. ### Step 3: Solve the Problem Let's assume the cost matrix is as follows (since the image is not visible, I'll provide a hypothetical matrix): | Machine \ Job | Job 1 | Job 2 | Job 3 | Job 4 | Job 5 | |---------------|-------|-------|-------|-------|-------| | Machine 1 | 10 | 5
____ __________ _____ ____ ______ ___ _________ _____ __________ _____ ____ ________.______ _________ ______ __________ ____ __________ ________ ________ _____ ____ _______.
_________ _______ ___ __________ _________ _____ __________ ___ ____ ______ ___ ________.
______ ___ _____ ______ __________ ________ ____ ___ _____ _____.
___ _______ ________ ______ _______ ______ ______ ____ ___ ___ ______ _________.
_______ ___ ______ ________ ______ _____ _______ ______.
______ ____ ___ ________ _________ ___.
____ _________ _____ __________ _____ ______ _________ __________ _________ ____ _______.
_________ ______ ______ ________ ____ ___ _______ _____.
________ ________ __________ _______ ______ __________ _________ ______ _______.
____ _____ ___ _______ ______ ____.
_____ _________ _______ _______ _______ ____ _____ _______ ___ __________ _________ ____.
_____ ______ ____ _________ ______ ______.
_____ __________ ___ ___ ____ ________ _____ __________.
____ _______ ___ ______ __________.
_______ _______ _________ ________ ________.
_______ ___ __________ _________ ______ ______ __________ _______.
________ __________ _________ _____ _____ ___ ____ ________ ________ ________ ____ _________.
__________ ___ ________ _______ ___ _____ _____ _________ _________ ___ _______.
________ ________ ______ _________ _____.
_____ ___ ________ _________ _____ ________.
___ ______ _____ ________ _______ ________ ___ __________.
________ ______ ___ __________ _____ ____.
___ _____ _______ ____ ____.
____ __________ ___ __________ ___.
__________ _________ _______ ___ ____.
_____ _____ ________ _____ ____ _________ _____ ______ ____.
_______ ________ _________ ________ ________ _____ ______ __________ ___ __________ ________ ______.
__________ ___ _________ ________ ________ ______.
______ ____ _____ _______ ____.
______ __________ ________ ___ ________ ________ _______ _______ _____ ____ ____.
_________ ____ ___ ______ ____ __________ ____ ______ _____ _________ _____ ____.
___ ___ ___ _________ ____ _________.
________ _________ __________ ____ __________.
_______ ____ ________ _______ ____ _______.
______ __________ ____ __________ __________ __________ _________.
_____ _____ _______ _______ ___ ______ _______ ___ ________ _______ ___ _____.
_________ ___ ______ _____ ____ _______ __________ ________ _________.
__________ _______ ____ _________ __________ ____ ___.
_____ ________ _____ ___ _____ _____ ________ _________ ____ ______ _______ ______.
__________ _____ ______ _________ _________ _______ _____ _________ ____ ______.
______ _____ ___ _______ _________ ________ ________ _________ ____.
____ _____ ___ ________ ____ ____ ___ _________ ______ ___ ______ ___.
____ ________ _______ _________ ________ __________ ___ ___ _____ ___ ___.
________ ______ __________ __________ ___ ________ ________ _______ ________ ____ _____ ____.
__________ _________ ____ _________ _______ ______ ____ ___ __________ __________.
__________ __________ ________ ___ ______.
___ ______ ___ __________ _____ _________ ___ ______ ______ ________.
____ _________ ___ ________ _________ ___.
_____ ____ ______ __________ _______ ______.
_________ _____ __________ ___ _____ ____ _____.
____ ______ _________ ______ ______ _________ ________.
__________ __________ ________ _____.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.