In the second phase, the solution is optimized on iterative basis.
In a given problem, if the number of rows is not equal to the number of columns and vice versa, then add a dummy row or a dummy column.
Furthermore, the constraints, which are of hard and soft constraints, involved in the said problems are briefly elaborated.
In addition, this paper presents various approaches to address various types of assignment problem.
With that, this paper classified assignment problems into two, which are timetabling problem and allocation problem.
The timetabling problem is further classified into examination, course, and school timetabling problems, while the allocation problem is divided into student-project allocation, new student allocation, and space allocation problems.
The assignment costs for dummy cells are always assigned as zero.
Select the smallest element of the whole matrix, which is NOT COVERED by lines.
This paper presents a review pertaining to assignment problem within the education domain, besides looking into the applications of the present research trend, developments, and publications.
Assignment problem arises in diverse situations, where one needs to determine an optimal way to assign subjects in the best possible way.