A multi-objective evolutionary algorithm for examination timetabling
From MaRDI portal
Recommendations
- A multiobjective framework for heavily constrained examination timetabling problems
- Multi-objective evolutionary algorithm for university class timetabling problem
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- scientific article; zbMATH DE number 1755533
- Solving the examination timetabling problem in GPUs
Cites work
- A graph-based hyper-heuristic for educational timetabling problems
- A robust simulated annealing based examination timetabling system.
- A survey of search methodologies and automated system development for examination timetabling
- A system for computing university examination timetables
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- An introduction to timetabling
- Ant colony optimization for the examination scheduling problem
- Case-based heuristic selection for timetabling problems
- Comparison of metaheuristic algorithms for examination timetabling problem
- Constraint satisfaction problems: Algorithms and applications
- Extended clique initialisation in examination timetabling
- Final examination scheduling
- scientific article; zbMATH DE number 1728533 (Why is no real title available?)
- scientific article; zbMATH DE number 1728534 (Why is no real title available?)
- scientific article; zbMATH DE number 1728535 (Why is no real title available?)
- scientific article; zbMATH DE number 1728536 (Why is no real title available?)
- scientific article; zbMATH DE number 4162324 (Why is no real title available?)
- scientific article; zbMATH DE number 1975084 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Hybrid heuristics for examination timetabling problem
- Hybrid variable neighbourhood approaches to university exam timetabling
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- New methods to color the vertices of a graph
- Recent research directions in automated timetabling
- Scheduling examinations to reduce second-order conflicts
- Solving examination timetabling problems through adaption of heuristic orderings
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Variants of simulated annealing for the examination timetabling problem
Cited in
(11)- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
- A cellular memetic algorithm for the examination timetabling problem
- An integer programming approach to curriculum-based examination timetabling
- Chaotic multiobjective evolutionary algorithm based on decomposition for test task scheduling problem
- Robust university course timetabling problem subject to single and multiple disruptions
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
- An adaptive flex-deluge approach to university exam timetabling
- Multi-objective evolutionary algorithm for university class timetabling problem
- scientific article; zbMATH DE number 1755533 (Why is no real title available?)
- Memetic techniques for examination timetabling
- A multiobjective framework for heavily constrained examination timetabling problems
This page was built for publication: A multi-objective evolutionary algorithm for examination timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842554)
