search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
3 votes
2.4k views

Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table :

Find out the minimum time required to complete all the jobs.

  1. $5$
  2. $11$
  3. $13$
  4. $15$ 
in Numerical Methods
recategorized by
2.4k views

1 Answer

4 votes

ans is C 13

0
Sir plz explain...
0
which method sir???
0

its hungarian method for assignment , for complete algorithm u may refer any std book or 

link    https://en.wikipedia.org/wiki/Hungarian_algorithm

0
The fourth row " 2 0 5 " also has a single zero. Then why not the second column is crossed ?
0
4th row initially 2 0 5 0 0  and finally  0 0 3  0 0  contains lots of zero
Answer:

Related questions

3 votes
1 answer
1
1k views
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of rows or columns rows + columns rows + columns -1 rows + columns +1
asked Aug 2, 2016 in Optimization jothee 1k views
1 vote
2 answers
2
669 views
An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number of rows or columns rows + columns rows + columns -1 rows + columns +1
asked Jul 22, 2016 in Others jothee 669 views
0 votes
1 answer
3
1.3k views
The given maximization assignment problem can be converted into a minimization problem by Subtracting each entry in a column from the maximum value in that column. Subtracting each entry in the table from the maximum value in that table. Adding each entry in a column from the maximum value in that column. Adding maximum value of the table to each entry in the table.
asked Jul 11, 2016 in Optimization makhdoom ghaya 1.3k views
2 votes
3 answers
4
1.7k views
The optimal solution of the following assignment problem using Hungarian method is I II III IV A 8 26 17 11 B 13 28 4 26 C 38 19 18 15 D 19 26 24 10 A B C D A I II III IV B I III II IV C I III IV II D I IV II III
asked Jul 7, 2016 in IS&Software Engineering jothee 1.7k views
...