English

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

Advertisements
Advertisements

Question

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?

Sum
Advertisements

Solution

We can express the matrix form

`[(31,25,33,29), (25,24,23,21), (19,21,23,24), (38,36,34,40)]`

Subtracting the smallest element in each row from every element of it,

`[(6,0,8,4), (4,3,2,0), (0,2,4,5), (4,2,0,6)]`

Subtracting the smallest element In each column from very element of it.

`[(6,0,8,4), (4,3,2,0), (0,2,4,5), (4,2,0,6)]`

All the zeros of the above matrix are covered with minimum number of lines as below :

No. of lines = No. of rows/columns

Assignment of jobs :

A → Q, B → S, C → P, D → R

Minimum cost = 25 + 21 + 19 + 34

                        = Rs 99

shaalaa.com
  Is there an error in this question or solution?
2014-2015 (March)

APPEARS IN

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

Solve the following minimal assignment problem and hence find the minimum value : 

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

 


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 maximal assignment problem :

Branch Manager Monthly Business ( Rs. lakh)
A B C D
P 11 11 9 9
Q 13 16 11 10
R 12 17 13 8
S 16 14 16 12

 


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.


Choose the correct alternative :

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


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


Give mathematical form of Assignment problem


What is the difference between Assignment Problem and Transportation Problem?


Choose the correct alternative:

Number of basic allocation in any row or column in an assignment problem can be


Choose the correct alternative:

The purpose of a dummy row or column in an assignment problem is to


Choose the correct alternative:

In an assignment problem involving four workers and three jobs, total number of assignments possible are


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 job production unit has four jobs P, Q, R, 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

Complete the following activity to find the optimal assignment to minimize the total processing cost.

Solution:

Step 1: Subtract the smallest element in each row from every element of it. New assignment matrix is obtained as follows :

Job Machines
(Processing cost in ₹)
I II III IV
P 6 0 8 4
Q 4 3 2 0
R 0 2 4 5
S 4 2 0 6

Step 2: Subtract the smallest element in each column from every element of it. New assignment matrix is obtained as above, because each column in it contains one zero.

Step 3: Draw minimum number of vertical and horizontal lines to cover all zeros:

Job Machines
(Processing cost in ₹)
I II III IV
P 6 0 8 4
Q 4 3 2 0
R 0 2 4 5
S 4 2 0 6

Step 4: From step 3, as the minimum number of straight lines required to cover all zeros in the assignment matrix equals the number of rows/columns. Optimal solution has reached.

Examine the rows one by one starting with the first row with exactly one zero is found. Mark the zero by enclosing it in (`square`), indicating assignment of the job. Cross all the zeros in the same column. This step is shown in the following table :

Job Machines
(Processing cost in ₹)
I II III IV
P 6 0 8 4
Q 4 3 2 0
R 0 2 4 5
S 4 2 0 6

Step 5: It is observed that all the zeros are assigned and each row and each column contains exactly one assignment. Hence, the optimal (minimum) assignment schedule is :

Job Machine Min.cost
P II `square`
Q `square` 21
R I `square`
S III 34

Hence, total (minimum) processing cost = 25 + 21 + 19 + 34 = ₹`square`


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×