Assignment Problem A balanced transportation problem in which All si = 1 and dj = 1 Therefore xij = 0 or 1 Cost matrix: contains cost, time, or distance Solve using Hungarian method IE 416, Chap 7:3, March 99
Given: Time to perform each job by each person Problem 1 Page 379 Given: Time to perform each job by each person Objective: Find assignments so that to Minimize the total hours IE 416, Chap 7, July 99
Transshipment Problem A special transportation problem in which, some points are not a simple supply point or a simple demand point, but several units will be shipped to them and shipped from them. i j k Demand Point Supply Point Transshipment Point IE 416, Chap 7, July 99
Cost of shipment of one unit: Need to decide about: Cost of shipment Capacity of each point Cost of shipment of one unit: Cij = 0 if i = j (from a point to itself) Cij = 0 if j is dummy point (do not ship) Cij = M if no information available or forbidden Cij > 0 if given Cij = penalty cost if i is dummy point (demand not met) IE 416, Chap 7, July 99
To From mobile Galveston N.Y. LA SUPPLY well1 $10 $13 $25 $28 150 well2 $15 $12 $26 200 Mobile $0 $6 $16 $17 $14 - DEMAND 140 160
Mobile NY Well 1 LA Well 2 Galveston