A multiobjective framework for heavily constrained examination timetabling problems

DOI10.1007/s10479-008-0490-3zbMath1202.90141OpenAlexW2091900097MaRDI QIDQ613763

Christine L. Mumford

Publication date: 22 December 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0490-3

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items

Operational research in education ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ A constructive approach to examination timetabling based on adaptive decomposition and ordering ⋮ Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure ⋮ Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy

Uses Software

• Hyperheuristics
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving examination timetabling problems through adaption of heuristic orderings
• A survey of search methodologies and automated system development for examination timetabling
• Hybrid variable neighbourhood approaches to university exam timetabling
• A robust simulated annealing based examination timetabling system.
• Recent research directions in automated timetabling
• A graph-based hyper-heuristic for educational timetabling problems
• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
• Principles of Constraint Programming
• 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