Advertisements
Advertisements
Question
If the given matrix is ______ matrix, the assignment problem is called balanced problem
Solution
Square
APPEARS IN
RELATED QUESTIONS
A job production unit has four jobs A, B, C, D which can be manufactured on each of the four machines P, Q, R and S. The processing cost of each job is given in the following table:
Jobs
|
Machines |
|||
P |
Q |
R |
S |
|
Processing Cost (Rs.)
|
||||
A |
31 |
25 |
33 |
29 |
B |
25 |
24 |
23 |
21 |
C |
19 |
21 |
23 |
24 |
D |
38 |
36 |
34 |
40 |
How should the jobs be assigned to the four machines so that the total processing cost is minimum?
Suggest optimum solution to the following assignment. Problem, also find the total minimum service time.
Service Time ( in hrs.)
Counters | Salesmen | |||
A | B | C | D | |
W | 41 | 72 | 39 | 52 |
X | 22 | 29 | 49 | 65 |
Y | 27 | 39 | 60 | 51 |
Z | 45 | 50 | 48 | 52 |
Solve the following minimal assignment problem :
Machines | A | B | C | D | E |
M1 | 27 | 18 | ∞ | 20 | 21 |
M2 | 31 | 24 | 21 | 12 | 17 |
M3 | 20 | 17 | 20 | ∞ | 16 |
M4 | 21 | 28 | 20 | 16 | 27 |
Determine `l_92 and l_93, "given that" l_91 = 97, d_91 = 38 and q_92 = 27/59`
Solve the following minimal assignment problem and hence find minimum time where '- ' indicates that job cannot be assigned to the machine :
Machines | Processing time in hours | ||||
A | B | C | D | E | |
M1 | 9 | 11 | 15 | 10 | 11 |
M2 | 12 | 9 | - | 10 | 9 |
M3 | - | 11 | 14 | 11 | 7 |
M4 | 14 | 8 | 12 | 7 | 8 |
A departmental head has three jobs and four subordinates. The subordinates differ in their capabilities and the jobs differ in their work
contents. With the help of the performance matrix given below, find out which of the four subordinates should be assigned which jobs ?
Subordinates | Jobs | ||
I | II | III | |
A | 7 | 3 | 5 |
B | 2 | 7 | 4 |
C | 6 | 5 | 3 |
D | 3 | 4 | 7 |
In a factory there are six jobs to be performed each of which should go through two machines A and B in the order A - B. The processing timing (in hours) for the jobs arc given here. You are required to determine the sequence for performing the jobs that would minimize the total elapsed time T. What is the value of T? Also find the idle time for machines · A and B.
Jobs | J1 | J2 | J3 | J4 | J5 | J6 |
Machine A | 1 | 3 | 8 | 5 | 6 | 3 |
MAchine B | 5 | 6 | 3 | 2 | 2 | 10 |
A job production unit has four jobs A, B, C, D which can be manufactured on each of the four machines P, Q, R and S. The processing cost of each job for each machine is given in the following table:
Jobs | Machines (Processing Cost in ₹) |
|||
P | Q | R | S | |
A | 31 | 25 | 33 | 29 |
B | 25 | 24 | 23 | 21 |
C | 19 | 21 | 23 | 24 |
D | 38 | 36 | 34 | 40 |
Find the optimal assignment to minimize the total processing cost.
Five wagons are available at stations 1, 2, 3, 4, and 5. These are required at 5 stations I, II, III, IV, and V. The mileage between various stations are given in the table below. How should the wagons be transported so as to minimize the mileage covered?
I | II | III | IV | V | |
1 | 10 | 5 | 9 | 18 | 11 |
2 | 13 | 9 | 6 | 12 | 14 |
3 | 3 | 2 | 4 | 4 | 5 |
4 | 18 | 9 | 12 | 17 | 15 |
5 | 11 | 6 | 14 | 19 | 10 |
Five different machines can do any of the five required jobs, with different profits resulting from each assignment as shown below:
Job | Machines (Profit in ₹) | ||||
A | B | C | D | E | |
1 | 30 | 37 | 40 | 28 | 40 |
2 | 40 | 24 | 27 | 21 | 36 |
3 | 40 | 32 | 33 | 30 | 35 |
4 | 25 | 38 | 40 | 36 | 36 |
5 | 29 | 62 | 41 | 34 | 39 |
Find the optimal assignment schedule.
Choose the correct alternative :
The assignment problem is said to be balanced if it is a ______.
In an assignment problem, if number of column is greater than number of rows, then a dummy column is added.
State whether the following is True or False :
In assignment problem, each facility is capable of performing each task.
Solve the following problem :
A dairy plant has five milk tankers, I, II, III, IV and V. These milk tankers are to be used on five delivery routes A, B, C, D and E. The distances (in kms) between the dairy plant and the delivery routes are given in the following distance matrix.
I | II | III | IV | V | |
A | 150 | 120 | 175 | 180 | 200 |
B | 125 | 110 | 120 | 150 | 165 |
C | 130 | 100 | 145 | 160 | 175 |
D | 40 | 40 | 70 | 70 | 100 |
E | 45 | 25 | 60 | 70 | 95 |
How should the milk tankers be assigned to the chilling center so as to minimize the distance travelled?
Choose the correct alternative:
When an assignment problem has more than one solution, then it is ______
Choose the correct alternative:
The assignment problem is said to be balanced if ______
What is the Assignment problem?
Give mathematical form of Assignment problem
A computer centre has got three expert programmers. The centre needs three application programmes to be developed. The head of the computer centre, after studying carefully the programmes to be developed, estimates the computer time in minitues required by the experts to the application programme as follows.
Programmers | ||||
P | Q | R | ||
Programmers | 1 | 120 | 100 | 80 |
2 | 80 | 90 | 110 | |
3 | 110 | 140 | 120 |
Assign the programmers to the programme in such a way that the total computer time is least.
A departmental head has four subordinates and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. His estimates of the time each man would take to perform each task is given below:
Tasks | |||||
1 | 2 | 3 | 4 | ||
Subordinates | P | 8 | 26 | 17 | 11 |
Q | 13 | 28 | 4 | 26 | |
R | 38 | 19 | 18 | 15 | |
S | 9 | 26 | 24 | 10 |
How should the tasks be allocated to subordinates so as to minimize the total manhours?
Assign four trucks 1, 2, 3 and 4 to vacant spaces A, B, C, D, E and F so that distance travelled is minimized. The matrix below shows the distance.
1 | 2 | 3 | 4 | |
A | 4 | 7 | 3 | 7 |
B | 8 | 2 | 5 | 5 |
C | 4 | 9 | 6 | 9 |
D | 7 | 5 | 4 | 8 |
E | 6 | 3 | 5 | 4 |
F | 6 | 8 | 7 | 3 |
Choose the correct alternative:
Number of basic allocation in any row or column in an assignment problem can be
Choose the correct alternative:
If number of sources is not equal to number of destinations, the assignment problem is called ______
Choose the correct alternative:
The solution for an assignment problem is optimal if
A natural truck-rental service has a surplus of one truck in each of the cities 1, 2, 3, 4, 5 and 6 and a deficit of one truck in each of the cities 7, 8, 9, 10, 11 and 12. The distance(in kilometers) between the cities with a surplus and the cities with a deficit are displayed below:
To | |||||||
7 | 8 | 9 | 10 | 11 | 12 | ||
From | 1 | 31 | 62 | 29 | 42 | 15 | 41 |
2 | 12 | 19 | 39 | 55 | 71 | 40 | |
3 | 17 | 29 | 50 | 41 | 22 | 22 | |
4 | 35 | 40 | 38 | 42 | 27 | 33 | |
5 | 19 | 30 | 29 | 16 | 20 | 33 | |
6 | 72 | 30 | 30 | 50 | 41 | 20 |
How should the truck be dispersed so as to minimize the total distance travelled?
A dairy plant has five milk tankers, I, II, III, IV and V. Three milk tankers are to be used on five delivery routes A, B, C, D and E. The distances (in kms) between the dairy plant and the delivery routes are given in the following distance matrix.
I | II | III | IV | V | |
A | 150 | 120 | 175 | 180 | 200 |
B | 125 | 110 | 120 | 150 | 165 |
C | 130 | 100 | 145 | 160 | 170 |
D | 40 | 40 | 70 | 70 | 100 |
E | 45 | 25 | 60 | 70 | 95 |
How should the milk tankers be assigned to the chilling center so as to minimize the distance travelled?
A department store has four workers to pack goods. The times (in minutes) required for each worker to complete the packings per item sold is given below. How should the manager of the store assign the jobs to the workers, so as to minimize the total time of packing?
Workers | Packing of | |||
Books | Toys | Crockery | Cutlery | |
A | 3 | 11 | 10 | 8 |
B | 13 | 2 | 12 | 12 |
C | 3 | 4 | 6 | 1 |
D | 4 | 15 | 4 | 9 |