The Analysis of Unbalanced Assignment Problems Using The Kotwal-Dhope Method To Develop A Massive Open Online Course

Abstract

This study discusses the optimal solution of the unbalanced assignment of minimization case in order to develop massive open online course in the Islamic Higher Education by using a new method that is the Kotwal-Dhope Method. The method was formed with the help of the Hungarian method and the Matrix One’s Assignment method was resolves the unbalanced assignment problem with a data size 8x4 which aims to minimize the total costs incurred by an Islamic Higher Education. The optimal solution with the Kotwal-Dhope Method begins by adding a dummy of one, carrying out the division operation of each column with the smallest element, after each row and column has a value of one, perform assignments in condition one so that each lecturer has their own job in develop massive open online course. Based on the results of this study it was found that, lecturer B was assigned to do stage 1 (Defining educational content), lecturer D was assigned to do stage 2 (Production and technical integration), lecturer E was assigned to do stage 3 (Communication), and lecturer H was assigned to do stage 4 (Course Animation and Overview). Then the assignments were: B → 1, D → 2, E → 3, H → 4. From the results of the assignment, the optimal solution for the minimum cost is 18 + 23 + 12 + 20 = 73 unit costs.