An assignment problem and its application in education domain: a review and potential path
type: Item
instance of: scholarly article
title: An assignment problem and its application in education domain: a review and potential path
zbMATH Open document ID: 1398.90004
DOI: 10.1155/2018/8958393
author: Syakinah Faudzi
author: Syariza Abdul-Rahman
author: R. Rahman
published in: Advances in Operations Research
publication date: 2018-07-18T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6905054
zbMATH Keywords: assignment
zbMATH Keywords: education
describes a project that uses: XHSTT
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/8958393
OpenAlex ID: W2803627640
cites work: Q4918945
cites work: A survey of search methodologies and automated system development for examination timetabling
cites work: Novel local-search-based approaches to university examination timetabling
cites work: Selected topics on assignment problems
cites work: A benchmark library and a comparison of heuristic methods for the linear ordering problem
cites work: Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
cites work: Automatic ambiguity resolution in natural language processing. An empirical approach
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
cites work: Setting the research agenda in automated timetabling: the second international timetabling competition
cites work: A column generation approach for solving the examination-timetabling problem
cites work: Solving examination timetabling problems through adaption of heuristic orderings
cites work: Adaptive linear combination of heuristic orderings in constructing examination timetables
cites work: A constructive approach to examination timetabling based on adaptive decomposition and ordering
cites work: Monte Carlo hyper-heuristics for examination timetabling
cites work: Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
cites work: Hybrid bee colony optimization for examination timetabling problems
cites work: Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university
cites work: An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
cites work: Developing compact course timetables with optimized student flows
cites work: Effective learning hyper-heuristics for the course timetabling problem
cites work: Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
cites work: Random partial neighborhood search for the post-enrollment course timetabling problem
cites work: Improved local search approaches to solve the post enrolment course timetabling problem
cites work: Solving the post enrolment course timetabling problem by ant colony optimization
cites work: A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
cites work: A survey of school timetabling research
cites work: When Is the Classroom Assignment Problem Hard?
cites work: Q2779799
cites work: Strong bounds with cut and column generation for class-teacher timetabling
cites work: Applying evolutionary computation to the school timetabling problem: The Greek case
cites work: XHSTT: an XML archive for high school timetabling problems in different countries
cites work: New integer linear programming approaches for course timetabling
cites work: School timetabling for quality student and teacher schedules
cites work: A GRASP strategy for a more constrained school timetabling problem
cites work: A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
cites work: A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
cites work: Two algorithms for the student-project allocation problem
cites work: Student-project allocation with preferences over projects
cites work: A genetic algorithm for the project assignment problem
cites work: Improved approximation bounds for the student-project allocation problem with preferences over projects
cites work: Towards improving the utilization of university teaching space
cites work: Integer programming methods for large-scale practical classroom assignment problems
Wikidata QID: Q129798106
description: scientific article; zbMATH DE number 6905054