Final examination scheduling
From MaRDI portal
Cited in
(16)- A graph coloring algorithm for large scale scheduling problems
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- Monte Carlo hyper-heuristics for examination timetabling
- Linear combinations of heuristics for examination timetabling
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- Variants of simulated annealing for the examination timetabling problem
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- A stochastic local search algorithm with adaptive acceptance for high-school timetabling
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- Scheduling activities among conflicting facilities to minimize conflict cost
- A practical three‐phase ILP approach for solving the examination timetabling problem
- Modelling and solving the university course timetabling problem with hybrid teaching considerations
- A survey of search methodologies and automated system development for examination timetabling
- A multi-objective evolutionary algorithm for examination timetabling
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
This page was built for publication: Final examination scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5626334)
