Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
12 views2 pages

Exercise 4

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views2 pages

Exercise 4

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Alexandria University ‫جامعة االسكندرية‬

Faculty of Engineering ‫كلية الهندسة‬


Chemical Engineering Department ‫قسم الهندسة الكيميائية‬

‫ـــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ‬
Operations Management
Sheet (4)
‫ـــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــــ‬
Solve the following LPP using Hungarian method

Problem (4.1)
A fix-it shop has three projects to repair and three workers. The owner has estimates of
wage costs for each worker for each project. The owner’s objective is to assign the three
projects to the workers in a way to get the lowest cost to the shop. Each project will be
assigned exclusively to one worker.
Project
Person
1 2 3
Adams 11 14 6
Brown 8 10 11
Cooper 9 12 7

Problem (4.2)
A contactor pays his subcontractors a fixed fee plus mileage for work performed. On a
given day the contractor is faced with three electrical jobs associated with various
projects. Given below are the distances between the subcontractors and the projects.
Subcontractor A B C
Westside 50 36 16
Federated 28 30 18
Goliath 35 32 20
Universal 25 25 14

Problem (4.3)
Consider the problem of assigning five operators to five machines. The assignment cost is
presented find the optimal solution
 Note (operator (E) cannot work on machine (5))
Machine
Person
1 2 3 4 5
A 3 8 2 10 3
B 8 7 2 9 7
C 6 4 2 7 5
D 8 4 2 3 5
E 9 10 6 9 5

Dr. Mohammed Abbas El-Naggar


Eng. Diaa El-din Ali El-Farghal
Problem (4.4)
A plant has four operators to be assigned to four machines. The time (minutes) required
by each worker to produce a product on each machine is shown in the following table.
Machine
Operator
A B C D
1 10 12 9 11
2 5 10 7 8
3 12 14 13 11
4 8 15 11 9

 Solve the following cases


 Assign the suitable operator to the suitable machine
 Consider having an extra operator in the plant, and management wants to
determine which operator to transfer to another department.
Machine
Operator
A B C D
1 10 12 9 11
2 5 10 7 8
3 12 14 13 11
4 8 15 11 9
5 14 16 10 6

 Now management identify the following constraints


 Operator 5 is not trained enough to use machine B.
 Operator 2 is the most qualified and must be assigned a machine.
Machine
Operator
A B C D
1 10 12 9 11
2 5 10 7 8
3 12 14 13 11
4 8 15 11 9
5 14 16 10 6

 Now consider adding a new machine E in the plant. Management wants to decide
whether or not to add the machine, and which machine is to be substituted.
Machine
Operator
A B C D E
1 10 12 9 11 14
2 5 10 7 8 16
3 12 14 13 11 10
4 8 15 11 9 6

Dr. Mohammed Abbas El-Naggar


Eng. Diaa El-din Ali El-Farghal

You might also like