Quality recovering of university timetables

DOI10.1016/j.ejor.2019.01.026zbMath1430.90278OpenAlexW2910504409MaRDI QIDQ666944

Matias Sørensen, Michael Lindahl, Thomas Riis Stidsen

Publication date: 12 March 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/6de46939-006f-4349-8e03-616acaf47128

zbMATH Keywords

integer programmingtimetablingmultiple objective programmingdisruptionsminimum perturbation

Mathematics Subject Classification ID

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

Related Items (2)

Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ Robust university course timetabling problem subject to single and multiple disruptions

Cites Work

• A new lower bound for curriculum-based course timetabling
• Integer programming methods for large-scale practical classroom assignment problems
• A supernodal formulation of vertex colouring with applications in course timetabling
• Hybrid search for minimal perturbation in dynamic CSPs
• Constraint solving in uncertain and dynamic environments: A survey
• Timetabling problem for university as assignment of activities to resources
• Local branching
• Probe backtrack search for minimal perturbation in dynamic scheduling
• Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
• An overview of curriculum-based course timetabling
• Penalising Patterns in Timetables: Novel Integer Programming Formulations
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

This page was built for publication: Quality recovering of university timetables