हिंदी

Solve the following problem : A plant manager has four subordinates, and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. This est

Advertisements
Advertisements

प्रश्न

Solve the following problem :

A plant manager has four subordinates, and four tasks to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. This estimate of the time each man would take to perform each task is given in the effectiveness matrix below.

  I II III IV
A 7 25 26 10
B 12 27 3 25
C 37 18 17 14
D 18 25 23 9

How should the tasks be allocated, one to a man, as to minimize the total man hours?

सारिणी
योग
Advertisements

उत्तर

Step 1: Row minimum
Subtract the smallest element in each row from every element in its row.
The matrix obtained is given below:

  I II III IV
A 0 18 19 3
B 9 24 0 22
C 23 4 3 0
D 9 16 14 0

Step 2: Column minimum
Subtract the smallest element in each column of assignment matrix obtained in step 1 from every element in its column.

  I II III IV
A 0 14 19 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0

Step 3:
Draw minimum number of vertical and horizontal lines to cover all zeros.
First cover all rows and columns which have maximum number of zeros.

  I II III IV
A 0 14 19 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0

Step 4:
From step 3, minimum number of lines covering all the zeros are 4, which is equal to order of the matrix, i.e., 4.
∴ Select a row with exactly one zero, enclose that zero in () and cross out all zeros in its respective column.
Similarly, examine each row and column and mark the assignment ().
∴ The matrix obtained is as follows:
Assigning through zeroes, we get,

  I II III IV
A 0 14 19 3
B 9 20 0 22
C 23 0 3 0
D 9 12 1 0

Step 5:
The matrix obtained in step 4 contains exactly one assignment for each row and column.
∴ Optimal assignment schedule is as follows:

Job Subordination Time (hrs)
A I 7
B III 3
C II 18
D IV 9

∴ Total minimum time = 7 + 3 + 18 + 9 = 37 hrs.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 7: Assignment Problem and Sequencing - Part I [पृष्ठ १२८]

APPEARS IN

बालभारती Mathematics and Statistics 2 (Commerce) [English] Standard 12 Maharashtra State Board
अध्याय 7 Assignment Problem and Sequencing
Part I | Q 1 | पृष्ठ १२८

वीडियो ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्न

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?


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

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 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.


The assignment problem is said to be unbalance if ______


Choose the correct alternative :

In an assignment problem if number of rows is greater than number of columns then


Fill in the blank :

When an assignment problem has more than one solution, then it is _______ optimal solution.


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.


Choose the correct alternative: 

Assignment Problem is special case of ______


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 ______


If the given matrix is ______ matrix, the assignment problem is called balanced problem


State whether the following statement is True or False:

The objective of an assignment problem is to assign number of jobs to equal number of persons at maximum cost


What is the Assignment problem?


Give mathematical form of Assignment problem


Find the optimal solution for the assignment problem with the following cost matrix.

    Area
    1 2 3 4
  P 11 17 8 16
Salesman Q 9 7 12 6
  R 13 16 15 12
  S 14 10 12 11

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


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 job production unit has four jobs P, Q, R, and S which can be manufactured on each of the four machines I, II, III, and IV. The processing cost of each job for each machine is given in the following table:

Job Machines
(Processing cost in ₹)
I II III IV
P 31 25 33 29
Q 25 24 23 21
R 19 21 23 24
S 38 36 34 40

Find the optimal assignment to minimize the total processing cost.


A plant manager has four subordinates and four tasks to perform. The subordinates differ in efficiency and task differ in their intrinsic difficulty. Estimates of the time subordinate would take to perform tasks are given in the following table:

  I II III IV
A 3 11 10 8
B 13 2 12 2
C 3 4 6 1
D 4 15 4 9

Complete the following activity to allocate tasks to subordinates to minimize total time.

Solution:

Step I: Subtract the smallest element of each row from every element of that row:

  I II III IV
A 0 8 7 5
B 11 0 10 0
C 2 3 5 0
D 0 11 0 5

Step II: Since all column minimums are zero, no need to subtract anything from columns.

Step III: Draw the minimum number of lines to cover all zeros.

  I II III IV
A 0 8 7 5
B 11 0 10 0
C 2 3 5 0
D 0 11 0 5

Since minimum number of lines = order of matrix, optimal solution has been reached

Optimal assignment is A →`square`  B →`square`

C →IV  D →`square`

Total minimum time = `square` hours.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×