An overview of curriculum-based course timetabling
From MaRDI portal
Publication:2355018
curriculum-based course timetablingexact algorithmsheuristic algorithmsmodelssurveyuniversity timetabling
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Comments on: ``An overview of curriculum-based course timetabling
- Comments on: ``An overview of curriculum-based course timetabling
- Comments on: ``An overview of curriculum-based course timetabling
- Comments on: ``An overview of curriculum-based course timetabling
- Rejoinder on: ``An overview of curriculum-based course timetabling
- A new model for curriculum-based university course timetabling
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Curriculum-based course timetabling with SAT and MaxSAT
- Real-life curriculum-based timetabling with elective courses and course sections
Cites work
- A branch-and-cut procedure for the Udine course timetabling problem
- A computational approach to enhancing course timetabling with integer programming
- A computational study of a cutting plane algorithm for university course timetabling
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
- A new lower bound for curriculum-based course timetabling
- A review of hyper-heuristics for educational timetabling
- A supernodal formulation of vertex colouring with applications in course timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Adaptive tabu search for course timetabling
- An effective hybrid algorithm for university course timetabling
- An integer programming formulation for a case study in university timetabling.
- Answer set programming as a modeling language for course timetabling
- Application of a real-world university-course timetabling model solved by integer programming
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Bounded vertex colorings of graphs
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Curriculum-based course timetabling with SAT and MaxSAT
- Decomposition, reformulation, and diving in university course timetabling
- Efficient solutions for a university timetabling problem through integer programming
- Evolutionary multi-criterion optimization. 5th international conference, EMO 2009, Nantes, France, April 7--10, 2009. Proceedings
- Fairness in academic course timetabling
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- Generating applicable synthetic instances for branch problems
- scientific article; zbMATH DE number 1728532 (Why is no real title available?)
- scientific article; zbMATH DE number 2102228 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- Integer programming methods for large-scale practical classroom assignment problems
- ITC2007 solver description: a hybrid approach
- Metaheuristics for university course timetabling
- Neighborhood portfolio approach for local search applied to timetabling problems
- Penalising patterns in timetables: novel integer programming formulations
- Recent research directions in automated timetabling
- Setting the research agenda in automated timetabling: the second international timetabling competition
- Solving the examination timetabling problem in GPUs
- Timetabling problems at the TU Eindhoven
- Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem
Cited in
(29)- Benders decomposition for curriculum-based course timetabling
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- A strategic view of university timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- 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
- Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system
- The multiphase course timetabling problem
- 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
- Comments on: ``An overview of curriculum-based course timetabling
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
- Real-life curriculum-based timetabling with elective courses and course sections
- Fairness in academic course timetabling
- Solving the international timetabling competition: a deterministic approach
- A new lower bound 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
- New constraints and features for the university course timetabling problem
- The generalized balanced academic curriculum problem with heterogeneous classes
- Comments on: ``An overview of curriculum-based course timetabling
- 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
- Quality recovering of university timetables
This page was built for publication: An overview of curriculum-based course timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355018)
