Efficient solutions for a university timetabling problem through integer programming
From MaRDI portal
Publication:1887870
DOI10.1016/j.ejor.2003.06.023zbMath1067.90135OpenAlexW2102642246MaRDI QIDQ1887870
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.06.023
Related Items (28)
A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems ⋮ School timetabling for quality student and teacher schedules ⋮ A decision support approach to automatic timetabling in higher education institutions ⋮ A decomposed metaheuristic approach for a real-world university timetabling problem ⋮ A MILP model for the teacher assignment problem considering teachers' preferences ⋮ A two-stage decomposition of high school timetabling applied to cases in Denmark ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem ⋮ An ILP based heuristic for a generalization of the post-enrollment course timetabling problem ⋮ A mixed-integer mathematical modeling approach to exam timetabling ⋮ Optimization of the integrated problem of employee timetabling and job shop scheduling ⋮ Exact and metaheuristic methods for a real-world examination timetabling problem ⋮ A matheuristic for customized multi-level multi-criteria university timetabling ⋮ A heuristic method to schedule training programs for small and medium enterprises ⋮ Computational models for timetabling problem ⋮ Preference-based assignment of university students to multiple teaching groups ⋮ Answer set programming as a modeling language for course timetabling ⋮ Unnamed Item ⋮ Timetabling problems at the TU Eindhoven ⋮ A branch-and-cut procedure for the Udine course timetabling problem ⋮ Curriculum based course timetabling: new solutions to Udine benchmark instances ⋮ Term-end exam scheduling at United States Military Academy/West Point ⋮ Polynomial reduction of time-space scheduling to time scheduling ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem ⋮ An overview of curriculum-based course timetabling ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An introduction to timetabling
- Finding a feasible course schedule using Tabu search
- Computerised decision aid for timetabling --- a case analysis
- A logic approach to the resolution of constraints in timetabling
- The combinatorics of timetabling
- Distribution requirements and compactness constraints in school timetabling
- A tabu search algorithm for computing an operational timetable
- A multi-objective course scheduling model: Combining faculty preferences for courses and times.
- An integer programming formulation for a case study in university timetabling.
- School Timetabling—A Case in Large Binary Integer Linear Programming
- University timetabling by constraint-based reasoning: A case study
- Timetabling for Greek high schools
- Implementation of a university course and examination timetabling system
This page was built for publication: Efficient solutions for a university timetabling problem through integer programming
