English
Tamil Nadu Board of Secondary EducationHSC Commerce Class 12

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

Advertisements
Advertisements

Question

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.

Chart
Sum
Advertisements

Solution

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
  Is there an error in this question or solution?
Chapter 10: Operations Research - Exercise 10.2 [Page 256]

APPEARS IN

Samacheer Kalvi Business Mathematics and Statistics [English] Class 12 TN Board
Chapter 10 Operations Research
Exercise 10.2 | Q 5 | Page 256

RELATED QUESTIONS

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 balanced if ______.


Choose the correct alternative :

The assignment problem is said to be balanced if it is a ______.


Choose the correct alternative :

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


The objective of an assignment problem is to assign ______. 


Choose the correct alternative:

The assignment problem is generally defined as a problem of ______


In an assignment problem if number of rows is greater than number of columns, then dummy ______ is added


Three jobs A, B and C one to be assigned to three machines U, V and W. The processing cost for each job machine combination is shown in the matrix given below. Determine the allocation that minimizes the overall processing cost.

    Machine
    U V W
Jobs A 17 25 31
B 10 25 16
C 12 14 11

(cost is in ₹ per unit)


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 7 2 4 4 5
4 18 9 12 17 15
5 11 6 14 19 10

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×