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

DOI10.1155/2018/8958393zbMath1398.90004OpenAlexW2803627640WikidataQ129798106 ScholiaQ129798106MaRDI QIDQ721078

Syakinah Faudzi, Rosshairy Abd. Rahman, Syariza Abdul-Rahman

Publication date: 18 July 2018

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/8958393

zbMATH Keywords

assignmenteducation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (2)

Task preference-based bottleneck assignment problem ⋮ A university-wide orientation course timetabling model and its modification for pandemic period

Uses Software

• XHSTT

Cites Work

• Unnamed Item
• Unnamed Item
• Effective learning hyper-heuristics for the course timetabling problem
• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
• Developing compact course timetables with optimized student flows
• A column generation approach for solving the examination-timetabling problem
• Integer programming methods for large-scale practical classroom assignment problems
• Hybrid bee colony optimization for examination timetabling problems
• Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
• An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• Improved approximation bounds for the student-project allocation problem with preferences over projects
• A constructive approach to examination timetabling based on adaptive decomposition and ordering
• A survey of school timetabling research
• XHSTT: an XML archive for high school timetabling problems in different countries
• Solving examination timetabling problems through adaption of heuristic orderings
• Selected topics on assignment problems
• A survey of search methodologies and automated system development for examination timetabling
• School timetabling for quality student and teacher schedules
• Two algorithms for the student-project allocation problem
• Applying evolutionary computation to the school timetabling problem: The Greek case
• A GRASP strategy for a more constrained school timetabling problem
• The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
• Student-project allocation with preferences over projects
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
• A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
• A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
• Random partial neighborhood search for the post-enrollment course timetabling problem
• Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university
• Improved local search approaches to solve the post enrolment course timetabling problem
• Monte Carlo hyper-heuristics for examination timetabling
• Solving the post enrolment course timetabling problem by ant colony optimization
• Strong bounds with cut and column generation for class-teacher timetabling
• Adaptive linear combination of heuristic orderings in constructing examination timetables
• New integer linear programming approaches for course timetabling
• A genetic algorithm for the project assignment problem
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• Novel Local-Search-Based Approaches to University Examination Timetabling
• Towards improving the utilization of university teaching space
• Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
• When Is the Classroom Assignment Problem Hard?
• On the Complexity of Timetable and Multicommodity Flow Problems
• Automatic ambiguity resolution in natural language processing. An empirical approach

This page was built for publication: An assignment problem and its application in education domain: a review and potential path