Linear combinations of heuristics for examination timetabling

DOI10.1007/s10479-011-0854-yzbMath1251.90119OpenAlexW2026736398MaRDI QIDQ1761893

Nam Pham, Rong Qu, Jay E. Yellen, Edmund Kieran Burke

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

zbMATH Keywords

weighted graphconstructive heuristicsexamination timetablinggraph colouring heuristicsheuristic combinations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Operational research in education ⋮ An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ 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 ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Chromatic optimisation: Limitations, objectives, uses, references
• Weighted graphs and university course timetabling
• A tabu search approach to the constraint satisfaction problem as a general problem solver
• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
• A Lagrangian Relaxation Approach To The Classroom Assignment Problem^*
• New methods to color the vertices of a graph
• Graph coloring conditions for the existence of solutions to the timetable problem
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• A system for computing university examination timetables
• Final examination scheduling
• Handbook of metaheuristics