Unit 4 Lecturer notes of Assignment Problem of OR by Dr. G.R
matrix. The assignment schedule corresponding to there zeros is the optimum (maximal) assignment. Note: the above procedure for assignment is Hungarian assignment method Problem 1. Three jobs A B C are to be assigned to three machines x Y Z. The processing costs are as given in the matrix shown below.
Link to this page:
Please notify us if you found a problem with this document: