Machine-translated by Google. Questions are authored in English.
Top

Discussion

The assignment cost of assigning any one operator to any one machine is given in the following table :

MachinesOperators
IIIIIIIV
U1051315
V39183
W10732
X51197

The optimal assignment is :

  • A.U \(\to\) II, V \(\to\) III, W \(\to\) I, X \(\to\) IV
  • B.U \(\to\) II, V \(\to\) IV, W \(\to\) III, X \(\to\) I
  • C.U \(\to\) III, V \(\to\) IV, W \(\to\) II, X \(\to\) I
  • D.U \(\to\) IV, V \(\to\) II, W \(\to\) III, X \(\to\) I

Answer: B

The optimal assignment is U \(\to\) II, V \(\to\) IV, W \(\to\) III, X \(\to\) I, at a total cost of 16.

Hungarian method. Subtract each row minimum (5, 3, 2, 5):

U: 5, 0, 8, 10; V: 0, 6, 15, 0; W: 8, 5, 1, 0; X: 0, 6, 4, 2.

Column minima are 0, 0, 1, 0; subtracting 1 from column III gives U: 5, 0, 7, 10; V: 0, 6, 14, 0; W: 8, 5, 0, 0; X: 0, 6, 3, 2. A full set of independent zeros is U-II, V-IV, W-III, X-I, so this assignment is optimal, with cost \(5 + 3 + 3 + 5 = 16\) (the total reduction \(15 + 1\)).

The other options cost far more: U-II, V-III, W-I, X-IV costs \(5 + 18 + 10 + 7 = 40\); U-III, V-IV, W-II, X-I costs \(13 + 3 + 7 + 5 = 28\); U-IV, V-II, W-III, X-I costs \(15 + 9 + 3 + 5 = 32\).

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.