Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
From MaRDI portal
Publication:1761890
DOI10.1007/s10479-010-0707-0zbMath1251.90117MaRDI QIDQ1761890
Fabio De Cesco, Alex Bonutti, Luca Di Gaspero
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-010-0707-0
90B35: Deterministic scheduling theory in operations research
Related Items
Boosting Answer Set Optimization with Weighted Comparator Networks, Rewriting optimization statements in answer-set programs, Answer set programming as a modeling language for course timetabling, Comments on: ``An overview of curriculum-based course timetabling, Real-life curriculum-based timetabling with elective courses and course sections, A decision support approach to automatic timetabling in higher education institutions, Developing compact course timetables with optimized student flows, A new lower bound for curriculum-based course timetabling, Integer programming methods for large-scale practical classroom assignment problems, Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem, XHSTT: an XML archive for high school timetabling problems in different countries, Quality recovering of university timetables, Benders decomposition for curriculum-based course timetabling, An integer programming approach to curriculum-based examination timetabling, \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming, A branch-and-cut procedure for the Udine course timetabling problem, Towards a reference model for timetabling and rostering, Curriculum based course timetabling: new solutions to Udine benchmark instances, Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling, A new model for curriculum-based university course timetabling, Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study, Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem, Flow formulations for curriculum-based course timetabling, An overview of curriculum-based course timetabling, Adaptive tabu search for course timetabling, Adaptive large neighborhood search for the curriculum-based course timetabling problem, Integer programming for minimal perturbation problems in university course timetabling, Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions, Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of search methodologies and automated system development for examination timetabling
- A computational study of a cutting plane algorithm for university course timetabling
- An integer programming formulation for a case study in university timetabling.
- Neighborhood portfolio approach for local search applied to timetabling problems
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Penalising Patterns in Timetables: Novel Integer Programming Formulations
