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?

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

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

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

Assignment Problem

Is there an error in this question or solution?

Q 6.2.3 Q 6.2.2 Next

2014-2015 (March)

APPEARS IN

2014-2015 (March) (with solutions)

Q 6.2.3 | 4 marks

Video TutorialsVIEW ALL [1]

view
Video Tutorials For All Subjects
Assignment Problem

video tutorial00:20:25

RELATED QUESTIONS

Suggest optimum solution to the following assignment. Problem, also find the total minimum service time.
Service Time ( in hrs.)

Counters	Salesmen
Counters	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 minimal assignment problem :

Machines	A	B	C	D	E
M₁	27	18	∞	20	21
M₂	31	24	21	12	17
M₃	20	17	20	∞	16
M₄	21	28	20	16	27

Solve the following maximal assignment problem :

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

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

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

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?

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:

In assignment problem, if number of columns is greater than number of rows, then a dummy row 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)

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:

If number of sources is not equal to number of destinations, the assignment problem is called ______

Choose the correct alternative:

The solution for an assignment problem is optimal if

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

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

Advertisements

Advertisements

Question

Advertisements

Solution

APPEARS IN

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

Select a course

	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

	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

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

Advertisements

Advertisements

Question

Advertisements

SolutionShow Solution

APPEARS IN

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

Select a course

Solution

	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