An overview of curriculum-based course timetabling
From MaRDI portal
Publication:2355018
DOI10.1007/s11750-015-0366-zzbMath1319.90026OpenAlexW2079600472MaRDI QIDQ2355018
Roberto Roberti, Andrea Bettinelli, Valentina Cacchiani, Paolo Toth
Publication date: 27 July 2015
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-015-0366-z
surveymodelsheuristic algorithmsexact algorithmscurriculum-based course timetablinguniversity timetabling
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (19)
Benders decomposition for curriculum-based course timetabling ⋮ Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem ⋮ An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ Adaptive large neighborhood search for the curriculum-based course timetabling problem ⋮ Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ Simulated annealing with penalization for university course timetabling ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ A matheuristic for customized multi-level multi-criteria university timetabling ⋮ A university-wide orientation course timetabling model and its modification for pandemic period ⋮ Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study ⋮ \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming ⋮ Quality recovering of university timetables ⋮ Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling ⋮ A strategic view of university timetabling ⋮ Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem ⋮ A new model for curriculum-based university course timetabling ⋮ Flow formulations for curriculum-based course timetabling ⋮ Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system ⋮ The multiphase course timetabling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A review of hyper-heuristics for educational timetabling
- Fairness in academic course timetabling
- 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
- Curriculum-based course timetabling with SAT and MaxSAT
- A supernodal formulation of vertex colouring with applications in course timetabling
- Bounded vertex colorings of graphs
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
- A computational study of a cutting plane algorithm for university course timetabling
- An effective hybrid algorithm for university course timetabling
- Evolutionary multi-criterion optimization. 5th international conference, EMO 2009, Nantes, France, April 7--10, 2009. Proceedings
- Application of a real-world university-course timetabling model solved by integer programming
- Decomposition, reformulation, and diving in university course timetabling
- An integer programming formulation for a case study in university timetabling.
- Recent research directions in automated timetabling
- Solving the examination timetabling problem in GPUs
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- A branch-and-cut procedure for the Udine course timetabling problem
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Efficient solutions for a university timetabling problem through integer programming
- ITC2007 solver description: a hybrid approach
- A computational approach to enhancing course timetabling with integer programming
- Adaptive tabu search for course timetabling
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- A survey of metaheuristic-based techniques for university timetabling problems
- Neighborhood portfolio approach for local search applied to timetabling problems
- Generating Applicable Synthetic Instances for Branch Problems
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Metaheuristics for University Course Timetabling
- Penalising Patterns in Timetables: Novel Integer Programming Formulations
- Answer set programming as a modeling language for course timetabling
- Timetabling problems at the TU Eindhoven
This page was built for publication: An overview of curriculum-based course timetabling
