Program for solving assignment problems and its application in lecturer resources allocation

Abstract

This paper proposes program for solving assignment problems by Hungarian method. Assignment problem is one of the most famous problems in linear programming and in combinatorial optimization. It can be solved by using an efficient method which is called Hangarian method. In this problem, commonly, there are a number of agents and a number of tasks. Any agent can be assigned to perform any task. The objective of this problem is to decide the right agent to perform the right task and also the total cost of the assignment is minimized. The manual calculation is time-consuming and prone to mistake. Therefore, this program can help to find the optimal solution with less time. In this approach, computer programming is used as an implementation tool to get the accurate solutions. The program can also be applied with the lecturer allocation for each subject to minimize lecturer's preparation time and to match the lecturer per individual expertise.