An assignment problem and its application in education domain: a review and potential path (Q721078)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An assignment problem and its application in education domain: a review and potential path
scientific article

    Statements

    An assignment problem and its application in education domain: a review and potential path (English)
    0 references
    0 references
    0 references
    0 references
    18 July 2018
    0 references
    Summary: 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 \(n\) subjects to \(m\) subjects in the best possible way. 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. 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. Moreover, direction and potential paths of problem solving based on the latest trend of approaches are also highlighted. As such, this review summarizes and records a comprehensive survey regarding assignment problem within education domain, which enhances one's understanding concerning the varied types of assignment problems, along with various approaches that serve as solution.
    0 references
    assignment
    0 references
    education
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references