Solving examination timetabling problems through adaption of heuristic orderings
From MaRDI portal
Publication:596455
DOI10.1023/B:ANOR.0000030684.30824.08zbMATH Open1056.90141OpenAlexW2022367909MaRDI QIDQ596455FDOQ596455
Authors: J. P. Newall, Edmund K. Burke 
Publication date: 10 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000030684.30824.08
Recommendations
- Adaptive linear combination of heuristic orderings in constructing examination timetables
- Adaptive selection of heuristics for improving exam timetables
- Linear combinations of heuristics for examination timetabling
- A constructive approach to examination timetabling based on adaptive decomposition and ordering
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
Cited In (31)
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Improving paper spread in examination timetables using integer programming
- A review of hyper-heuristics for educational timetabling
- Adaptive selection of heuristics for improving exam timetables
- An assignment problem and its application in education domain: a review and potential path
- A survey of search methodologies and automated system development for examination timetabling
- Applying evolutionary computation to the school timetabling problem: The Greek case
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Hybrid variable neighbourhood approaches to university exam timetabling
- An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
- Operational research in education
- Memetic techniques for examination timetabling
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
- A multiobjective framework for heavily constrained examination timetabling problems
- Hybrid bee colony optimization for examination timetabling problems
- Monte Carlo hyper-heuristics for examination timetabling
- A constructive approach to examination timetabling based on adaptive decomposition and ordering
- Preprocessing and an improved MIP model for examination timetabling
- Adaptive linear combination of heuristic orderings in constructing examination timetables
- Solving the examination timetabling problem in GPUs
- A multi-objective evolutionary algorithm for examination timetabling
- Automated generation of constructive ordering heuristics for educational timetabling
- A new model for automated examination timetabling
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- Linear combinations of heuristics for examination timetabling
- An adaptive flex-deluge approach to university exam timetabling
- A Pareto-based search methodology for multi-objective nurse scheduling
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy
- Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems
This page was built for publication: Solving examination timetabling problems through adaption of heuristic orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596455)
