Question
Four professors are capable of teaching any one of four different courses. Class preparation time in hours for different topics varies from professor to professor and is given in the table below:
| Professor | A | B | C | D | ||||
| Linear Programming | 2 | 15 | 13 | 4 | ||||
| Queuing Theory | 10 | 4 | 14 | 15 | ||||
| Transportation Problem | 9 | 14 | 16 | 13 | ||||
| Regression Analysis | 7 | 8 | 11 | 9 | ||||
Each professor is assigned only one course. Determine an assignment schedule so as to minimise the total course preparation time for all courses.
Answer :
Word Count : 458
_______ _______ ______ ________ ________.
_________ _____ ______ ____ ______ _____ _____ __________ _____ ________ ___ ______.
__________ _____ ___ _________ _____ ________ ____.
________ _______ _________ _____ _________ ________ _____ __________ __________.
_______ _______ __________ _________ ___ ____ _______ ______ ______.
______ _________ _______ _______ _________.
________ _________ ______ _________ ____ ________ __________ ______ _____ ____ ___ ________.
____ __________ ____ _____ ___ _________.
_______ __________ ________ _______ ______.
_____ _______ ___ ___ _________ ________ ________ __________ _____ ____.
_________ ____ _____ _________ ______.
________ _______ __________ ___ _____.
___ ________ ________ ____ ___.
_____ ______ __________ _____ ______ _______ _______ ______.
____ __________ ______ ______ ______.
_________ __________ _______ _____ ________ __________ _______ ___.
_______ _______ _______ __________ ________ ______ ___ __________ __________ ____.
____ ___ ________ ___ ________ __________ _________ ________ _______.
__________ ___ ______ _______ ________ _____.
_________ ________ ____ __________ __________ _________ ________ ______ _______.
_____ ___ ________ _____ ____ ______.
______ __________ _______ ____ __________ ___ __________ _________ ____ _________ ______ _______.
_________ ____ ______ ___ ______.
___ ___ ______ _____ _______ ___ _________ _________ _________ ___.
______ _______ _________ _____ _________ ________ ______ _________ _______ _____ _______.
______ _______ ___ ___ _______ ____ ______ __________ _________ ____ _________.
_______ _____ ______ ____ _________ _______.
___ _____ ____ ___ ______ ______ ______ _____ _______ __________ __________.
_______ ________ _______ __________ _________.
__________ ____ _____ _____ ____.
_____ _________ _____ __________ _________ ___.
_________ _____ __________ _________ ___ ______ ______ _________ __________.
_______ ______ _________ _________ _______ ______ ________ _____ _____ _____.
__________ ______ __________ __________ _________ _____ ___ __________ _____.
_____ __________ ___ ________ ___ _______ _________ _______ ____ _____ _____ ___.
________ _______ ______ ______ ____ _____ _______ ________ _____ __________ _____.
____ __________ ______ ______ ____ ________ _________ _____.
_____ ______ ___ ________ _______ _________ ________ __________ ________ __________ _________ _______.
________ ____ ________ ______ _________ ________ ____ _________ ___ _________.
__________ _________ __________ _______ _______.
________ _________ ________ _____ _________.
___ ______ _________ _____ ____ ______ ___ ______ ___.
____ _________ _________ ______ __________ ______ _______ _______.
Skip in 10
This is an Assignment Problem, which can be solved using the Hungarian Method to minimize the total preparation time. ### Step 1: Construct the Cost Matrix Each professor (A, B, C, D) is assigned to one of the four courses, and the given preparation times are: | Course / Professor | A | B | C | D | |--------------------|----|----|----|----| | Linear Programming | 2 | 15 | 13 | 4 | | Queuing Theory | 10 | 4 | 14 | 15 | | Transportation Problem | 9 | 14 | 16 | 13 | | Regression Analysis | 7 | 8 | 11
___ ___ __________ _____ _______ _________ _____._______ _______ ______ ________ ________.
_________ _____ ______ ____ ______ _____ _____ __________ _____ ________ ___ ______.
__________ _____ ___ _________ _____ ________ ____.
________ _______ _________ _____ _________ ________ _____ __________ __________.
_______ _______ __________ _________ ___ ____ _______ ______ ______.
______ _________ _______ _______ _________.
________ _________ ______ _________ ____ ________ __________ ______ _____ ____ ___ ________.
____ __________ ____ _____ ___ _________.
_______ __________ ________ _______ ______.
_____ _______ ___ ___ _________ ________ ________ __________ _____ ____.
_________ ____ _____ _________ ______.
________ _______ __________ ___ _____.
___ ________ ________ ____ ___.
_____ ______ __________ _____ ______ _______ _______ ______.
____ __________ ______ ______ ______.
_________ __________ _______ _____ ________ __________ _______ ___.
_______ _______ _______ __________ ________ ______ ___ __________ __________ ____.
____ ___ ________ ___ ________ __________ _________ ________ _______.
__________ ___ ______ _______ ________ _____.
_________ ________ ____ __________ __________ _________ ________ ______ _______.
_____ ___ ________ _____ ____ ______.
______ __________ _______ ____ __________ ___ __________ _________ ____ _________ ______ _______.
_________ ____ ______ ___ ______.
___ ___ ______ _____ _______ ___ _________ _________ _________ ___.
______ _______ _________ _____ _________ ________ ______ _________ _______ _____ _______.
______ _______ ___ ___ _______ ____ ______ __________ _________ ____ _________.
_______ _____ ______ ____ _________ _______.
___ _____ ____ ___ ______ ______ ______ _____ _______ __________ __________.
_______ ________ _______ __________ _________.
__________ ____ _____ _____ ____.
_____ _________ _____ __________ _________ ___.
_________ _____ __________ _________ ___ ______ ______ _________ __________.
_______ ______ _________ _________ _______ ______ ________ _____ _____ _____.
__________ ______ __________ __________ _________ _____ ___ __________ _____.
_____ __________ ___ ________ ___ _______ _________ _______ ____ _____ _____ ___.
________ _______ ______ ______ ____ _____ _______ ________ _____ __________ _____.
____ __________ ______ ______ ____ ________ _________ _____.
_____ ______ ___ ________ _______ _________ ________ __________ ________ __________ _________ _______.
________ ____ ________ ______ _________ ________ ____ _________ ___ _________.
__________ _________ __________ _______ _______.
________ _________ ________ _____ _________.
___ ______ _________ _____ ____ ______ ___ ______ ___.
____ _________ _________ ______ __________ ______ _______ _______.
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.