OPTIMIZATION OF ASSIGNMENT PROBLEMS USING GRAPH MODIFIED JASIM METHOD (CASE STUDY ON CV KAMPUNG JATI)

The assignment problem is a special case of transportation problems, with inventory constraints and both of them are worth one and the decision variable is a binary variable. The Graph Jasim method is a method used to solve balanced assignment problem. This final project shows that the Graph Jasim method is not optimal for some assignment problems, so that it is corrected to the Graph Modified Jasim method and analyzes the Graph Modified Jasim method. The procedure for obtaining solutions is explained in numerical simulations. Furthermore, compared to the simulation results on the CV Kampung Jati Blora between the Graph Modified Jasim method and the Hungarian method, both methods are proven to obtain the same optimal solution. Keywords: Assignment problem, Graph Jasim method, Graph Modified Jasim method, Hungarian method