Assignment Practice Problems

Problem No. 1: Refer to the assignment problem on page 63 and solve it (Note: it is a
max problem).

Problem No. 2: Refer to the assignment problem (Sheet No. 2 problem No. 3) and solve
it.

Problem No. 3: Consider the following data of assigning jobs to machines:

Machine A Machine B Machine C Machine D
Job 1 12 16 14 10
Job 2 9 8 13 7
Job 3 15 12 9 11

a. Formulate the mathematical model for the assignment problem

b. Solve the problem using the Hungarian Method to find the minimum cost of
assignment.

Problem 4: Five employees are available to perform four jobs. The time it takes each
person to perform each job is given in the following table.
Time (hours)
Job 1 Job 2 Job 3 Job 4
Person 1 22 18 30 18
Person 2 18 --- 27 22
Person 3 26 20 28 28
Person 4 16 22 ---- 14
Person 5 21 --- 25 28
Note: dashes indicate person cannot do that particular job.

a. Formulate the mathematical model for the assignment problem

b. Determine the assignment of employees to jobs that minimizes the total time
required to perform the four jobs.

Transshipment Practice Problems

Problem No 1: (Solved in the Lecture)

Widgetco manufactures widgets at two factories, one in Memphis and one in Denver. The
Memphis factory can produce up to 150 widgets per day, and the Denver factory can
produce up to 200 widgets per day. Widgets are shipped by air to customers in Los
Angeles and Boston. The customers in each city require 130 widgets per day. Because of
the deregulation of air fares, Widgetco believes that it may be cheaper to first fly some
widgets to New York or Chicago and then fly them to their final destination. The costs of
flying a widget are shown the below table Widgetco wants to minimize the total cost of
shipping the required widgets to its customers.
 Problem No. 1 (continued)
To
From Memphi Denver N.Y. Chicago L.A. Boston
s
Memphis $0 --- $8 $13 $25 $28
Denver --- $0 $15 $12 $26 $25
N.Y. --- --- $0 $6 $16 $17
Chicago --- --- $6 $0 $14 $16
L.A. --- --- --- --- $0 ---
Boston --- --- --- --- --- $0
Note: dashes indicate shipments are not allowed

Problem No 2: Sunco Oil produces oil at two wells. Well 1 can produce up to 160,000
barrels per day, and well 2 can produce up to 140,000 barrels per day. It is possible to
ship oil directly from wells to Sunco's customers in Los Angeles and New York.
Alternatively, Sunco could transport oil to the ports of Mobile and Galveston and then
ship it by tanker to New York or Los Angeles. The capacity of Galveston is 150,000
barrels per day and Mobile has a capacity of 180,000 barrels per day. Los Angeles require
requires 150,000 barrels per day and New York 200,000 barrels per day. The costs of
shipping 1000 barrels between two points are shown in the following table. Solve the
problem to minimize the transportation costs. (use northwest corner, max 2 tableaus)
To
From Well 1 Well 2 Mobile Galveston N.Y. L.A.
Well 1 $0 --- $10 $13 $25 $28
Well 2 --- $0 $15 $12 $26 $25
Mobile --- --- $0 $6 $16 $17
Galveston --- --- $6 $0 $14 $16
N.Y. --- --- --- --- $0 ---
L.A. --- --- --- --- $15 $0
Note: dashes indicate shipments are not allowed

Problem No 3: Prepare the initial transportation tableau using the Northwest corner

200 250

Borg Sadat Port

Elarab City Said

6th of
Oct.

100 125
Amrey Ismalya
a 10th of
Ramadan