मराठी
तामिळनाडू बोर्ड ऑफ सेकेंडरी एज्युकेशनएचएससी वाणिज्य इयत्ता १२

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 - Business Mathematics and Statistics

Advertisements
Advertisements

प्रश्न

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.

तक्ता
बेरीज
Advertisements

उत्तर

Here the number of rows and columns are equal.

∴ The given assignment problem is balanced.

Step 1: Select the smallest element in each row and subtract this from all the elements in its row.

  Programmers
    P Q R
Programmers 1 40 20 0
  2 0 10 30
  3 0 30 10

Step 2: Select the smallest element in each column and subtract this from all the elements in its column.

  Programmers
    P Q R
Programmers 1 40 10 0
  2 0 0 30
  3 0 20 10

Step 3: Examine the rows with exactly one zero, mark the zero by □. Mark other zeros in its column by X.

  Programmers
    P Q R
Programmers 1 40 10 0
  2 0 0 30
  3 0 20 10

Step 4: Now examine the columns with exactly one zero mark the zero by □.

Mark other zeros in its row by X.

  Programmers
    P Q R
Programmers 1 40 10 0
  2 0 0 30
  3 0 20 10

Thus all the three assignment have been made.

The optimal assignment schedule and total cost is

Programmers Programmes Cost
1 R 80
2 Q 90
3 P 110
Total Cost 280

The optimal assignment (minimum) cost = ₹ 280.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 10: Operations Research - Exercise 10.2 [पृष्ठ २५६]

APPEARS IN

सामाचीर कलवी Business Mathematics and Statistics [English] Class 12 TN Board
पाठ 10 Operations Research
Exercise 10.2 | Q 5 | पृष्ठ २५६

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

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

 


The objective of an assignment problem is to assign ______. 


State whether the following is True or False :

It is not necessary to express an assignment problem into n x n matrix.


Choose the correct alternative:

The assignment problem is generally defined as a problem of ______


Choose the correct alternative:

The assignment problem is said to be balanced if ______


What is the Assignment problem?


What is the difference between Assignment Problem and Transportation Problem?


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:

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


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×