Scribd
Upload
580 views25 pages

Or!

A lead draftsman has five drafting tasks to assign to five idle draftsmen. Each task requires a different number of hours for each draftsman. The problem presents the hours required for each task by each draftsman in a table. A six step method is provided to solve the task assignment problem and determine the minimum total hours and cost. The steps involve subtracting the lowest values, adding/subtracting at intersections, removing zeros, and systematically cutting rows and columns to assign each task to a draftsman. The solution finds that the minimum total hours is 365 hours at a cost of Rs. 5767.

Uploaded by

Jigar Mehta
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
580 views25 pages

Or!

A lead draftsman has five drafting tasks to assign to five idle draftsmen. Each task requires a different number of hours for each draftsman. The problem presents the hours required for each task by each draftsman in a table. A six step method is provided to solve the task assignment problem and determine the minimum total hours and cost. The steps involve subtracting the lowest values, adding/subtracting at intersections, removing zeros, and systematically cutting rows and columns to assign each task to a draftsman. The solution finds that the minimum total hours is 365 hours at a cost of Rs. 5767.

Uploaded by

Jigar Mehta
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 25

Presented To: Dr.

Rajesh Thakkar Presented By: Group A-3

Presented By:Shikha Binandani Jay Bulchandani Fatima Khader Jigar Mehta Vishal Mehta (11011) (11012) (11032) (11041) (11042)

Presented To:Rajesh Thakkar

Q. A lead draftsman has five drafting


tasks to accomplish and five idle draftsmen. Each draftsman is estimated to require the following number of hours for each task.

SOLUTION
Step 1. Find out the lowest element
from each row and then subtract them with each element of that respected row.

TASKS A 1 Draftsmen 60 B 50 50 C 100 D 85 E 95

2
3 4 5

65
70 70 60

45 45
60 60 55 55 40 40

100
110 105 120

75
97 90 85

90
85 93 97

So after subtracting lowest element of each row from every element of that row we get.
TASKS A B C D E

1 2
3 4 5

10 20
10 15 20

0 0
0 0 0

50 55
50 50 80

35 30
27 35 45

45 45
15 38 57

Draftsmen

Step 2. Now, Find lowest element from


each coloum and then subtract them with
each element of that respected coloum.

TASKS
A 1 10 10 B 0 0 C 50 50 D 35 E 45

20

55

30

45

Draftsma
n

10

50

27 27

15 15

15

50

35

38

20

80

45

57

So after subtracting lowest element of each coloum from every element of that coloum we get.
TASKS

A 1 Draftsmen 2 3 4 0 10 0 5

B 0 0 0 0

C 0 5 0 0

D 8 3 O 8

E 30 30 0 23

10

30

18

42

Step 3. So after getting all the zeros draw


horizontal & vertical lines to cover all zeros with

minimum lines to find out is the problem ready for


Assignment or not.

TASKS

1
Draftsmen 2 3 4 5

0
0

0 0 0

0 0

So, now we get the solution..


No. of lines = 4 And order of our problem = 5 So this means our problem is not ready for the Assignment

Step 4. So now SUBTRACT the smallest


uncovered element from each uncovered

element and ADD that element to the


elements where horizontal and vertical

lines are intersecting each other

TASKS

A 1 Draftsmen 2 3 4 0 10 0 5

B 0 0 0 0

C 0 5 0 0

D 8 3 3 0 8

E 30 30 0 23

10

30

18

42

So, we found that 3 is the smallest element and so add & subtract it with elements as explained in step 4....
TASKS A 1 Draftsmen 2 3 4 5 0 10 3 0 53 10 3 B 0 C 0 D 8 +3 5 0 +3 0 0 0 30 +3 83 18 3 23 3 42 3 33 O 30 3 0 E 30

+3
0 0

After Adding & Subtracting we get the following result.


TASKS
A 1 0 7 0 2 7 B 3 0 3 0 0 C 3 5 3 0 30 D 8 0 O 5 15 E 30 27 0 20 39

Draftsme n

2 3 4 5

Step 5. So now after subtracting the smallest


uncovered element from the each uncovered

elements and adding that smallest uncovered


element to the elements where horizontal & vertical lines are intersecting each other, take out all the zeros from them and again draw horizontal & vertical lines to check whether the

problem is ready or not for Assignment.

TASKS

1 Draftsmen 2

So, now we get the solution..


No. of lines = 5

And order of our problem = 5

Thus we can see that now our problem order and no. of lines are same, so we can say that our problem is now ready for the Assignment.

Step 6. Now find out the row with single zero from top
and select the zero and then cut the coloum with

selected zero and repeat this process again till any


zero left and then if there are no single zeros left in a row do the same process coloum wise first find out

coloum with single zero and then select the zero and
cut the row with selected zero..

TASKS

1 Draftsmen 2

0 0 0 0 0

0 0

0 0

0 0

Thus, we have got five assignments as required by the problem. The assignment is as follows: 1-A , 2-D , 3-E , 4-C , 5-B So, total no. of hours worked by Draftsman = 60 + 75 + 85 +105 + 40 = 365 hours.. & Per hour cost is Rs15.80/So minimum cost = No. of hours worked X cost per hour = 365 X Rs15.80/= Rs.5767/-

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy