हिंदी

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.

Advertisements
Advertisements

प्रश्न

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
सारिणी
योग
Advertisements

उत्तर

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

Packing Books Toys Crockery Cutlery
Workers
A 0 8 7 5
B 11 0 10 0
C 2 3 5 0
D 0 11 0 5

Step 2: Since each column contains minimum element 0, subtracting it from every element of each column will given the same table as above.

Step 3: Drawing horizontal and vertical lines to cover all zeros.

Packing Books Toys Crockery Cutlery
Workers
A 0 0 7 5
B 11 0 10 0
C 2 3 5 0
D 0 11 0 5

Step 4: Number of horizontal lines (4) = order of matrix (4), optimal solution has reached.

Assigning through zeroes, we get

Packing Books Toys Crockery Cutlery
Workers
A `bb(0)` 8 7 5
B 11 `bb(0)` 10 `bb(cancel(0))`
C 2 3 5 `bb(0)`
D `bb(cancel(0))` 11 `bb(0)` 5

∴ Optimal Assignment schedule: A → Books

B → Bays, C → Cutlery, D → Crockery

Total minimum Time = 3 + 2 + 4 + 1 = 10 min

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
2025-2026 (March) Model set 1 by shaalaa.com

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

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

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

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.


The assignment problem is said to be unbalance if ______


The assignment problem is said to be balanced if ______.


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: 

Assignment Problem is special case of ______


Choose the correct alternative:

When an assignment problem has more than one solution, then it is ______


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


State whether the following statement is True or False:

In assignment problem, if number of columns is greater than number of rows, then a dummy row is added


What is the Assignment problem?


Give mathematical form of Assignment problem


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)


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?


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

Choose the correct alternative:

North – West Corner refers to ______


Choose the correct alternative:

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


A car hire company has one car at each of five depots a, b, c, d and e. A customer in each of the fine towers A, B, C, D and E requires a car. The distance (in miles) between the depots (origins) and the towers(destinations) where the customers are given in the following distance matrix.

  a b c d e
A 160 130 175 190 200
B 135 120 130 160 175
C 140 110 155 170 185
D 50 50 80 80 110
E 55 35 70 80 105

How should the cars be assigned to the customers 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.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×