Quality recovering of university timetables

DOI10.1016/J.EJOR.2019.01.026zbMATH Open1430.90278OpenAlexW2910504409MaRDI QIDQ666944FDOQ666944

Authors: Michael Lindahl, Matias Sørensen, Thomas R. 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

Recommendations

• Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
• Robust university course timetabling problem subject to single and multiple disruptions
• Integer programming for minimal perturbation problems in university course timetabling
• A strategic view of university timetabling
• A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem

zbMATH Keywords

integer programmingmultiple objective programmingtimetablingdisruptionsminimum perturbation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Integer programming for minimal perturbation problems in university course timetabling
• Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
• Robust university course timetabling problem subject to single and multiple disruptions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666944)