Linear combinations of heuristics for examination timetabling
DOI10.1007/S10479-011-0854-YzbMATH Open1251.90119OpenAlexW2026736398MaRDI QIDQ1761893FDOQ1761893
Jay Yellen, Nam Pham, Edmund K. Burke, Rong Qu
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0854-y
weighted graphconstructive heuristicsexamination timetablinggraph colouring heuristicsheuristic combinations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- New methods to color the vertices of a graph
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Final examination scheduling
- A survey of search methodologies and automated system development for examination timetabling
- Case-based heuristic selection for timetabling problems
- Hybrid variable neighbourhood approaches to university exam timetabling
- Handbook of metaheuristics
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- A system for computing university examination timetables
- Weighted graphs and university course timetabling
- Chromatic optimisation: Limitations, objectives, uses, references
- Graph coloring conditions for the existence of solutions to the timetable problem
Cited In (10)
- Extended clique initialisation in examination timetabling
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- Operational research in education
- A constructive approach to examination timetabling based on adaptive decomposition and ordering
- The design and implementation of an interactive course-timetabling system
- Adaptive linear combination of heuristic orderings in constructing examination timetables
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- An integer programming approach to curriculum-based examination timetabling
- Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy
This page was built for publication: Linear combinations of heuristics for examination timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761893)
